Automata Implementation
Editat de Jean-Marc Champarnaud, Denis Maurel, Djelloul Ziadien Limba Engleză Paperback – 13 oct 1999
Preț: 319.15 lei
Preț vechi: 398.93 lei
-20% Nou
Puncte Express: 479
Preț estimativ în valută:
56.47€ • 66.38$ • 49.46£
56.47€ • 66.38$ • 49.46£
Carte tipărită la comandă
Livrare economică 29 ianuarie-12 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540666523
ISBN-10: 3540666524
Pagini: 260
Ilustrații: X, 250 p.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.4 kg
Ediția:1999
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540666524
Pagini: 260
Ilustrații: X, 250 p.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.4 kg
Ediția:1999
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Extended Context-Free Grammars and Normal Form Algorithms.- On Parsing LL-Languages.- On Parsing and Condensing Substrings of LR Languages in Linear Time.- Minimal Cover-Automata for Finite Languages.- Determinization of Glushkov Automata.- Implementing Reversed Alternating Finite Automaton (r-AFA) Operations.- Operations on DASG.- Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching.- The Syntactic Prediction with Token Automata: Application to HandiAS System.- Bi-directional Automata to Extract Complex Phrases from Texts.- A Fast New Semi-incremental Algorithm for the Construction of Minimal Acyclic DFAs.- Using Acceptors as Transducers.- Proving Sequential Function Chart Programs Using Automata.- Automata and Computational Probabilities.- Automata and Binary Decision Diagrams.- Operations over Automata with Multiplicities.- Paging Automata.- On the Syntax, Semantics, and Implementation of a Graph-Based Computational Environment.- The Finite State Automata’s Design Patterns.- Automata to Recognize Finite and Infinite Words with at Least Two Factorizations on a Given Finite Set.- Autographe: A Graphical Version of Automate.- INTEX 4.1 for Windows: A Walkthrough.