Implementation and Application of Automata
Editat de Jan Holub, Jan ¿Dáreken Limba Engleză Paperback – 7 noi 2007
Preț: 324.22 lei
Preț vechi: 405.27 lei
-20%
Puncte Express: 486
Carte tipărită la comandă
Livrare economică 19 octombrie-02 noiembrie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540763352
ISBN-10: 354076335X
Pagini: 340
Ilustrații: XIII, 326 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.52 kg
Ediția:2007
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 354076335X
Pagini: 340
Ilustrații: XIII, 326 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.52 kg
Ediția:2007
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Talks.- Spiking Neural P Systems Used as Acceptors and Transducers.- Linear-Time Model Checking: Automata Theory in Practice.- OpenFst: A General and Efficient Weighted Finite-State Transducer Library.- Automata Applications in Chip-Design Software.- Contributed Talks.- Synchronizing Automata Preserving a Chain of Partial Orders.- Reducing Acyclic Cover Transducers.- On-the-Fly Stuttering in the Construction of Deterministic ?-Automata.- Average Value and Variance of Pattern Statistics in Rational Models.- Weighted Automata and Weighted Logics with Discounting.- Regulated Nondeterminism in Pushdown Automata.- Deterministic Caterpillar Expressions.- Backward and Forward Bisimulation Minimisation of Tree Automata.- An Implementation of Deterministic Tree Automata Minimization.- Accelerating Boyer Moore Searches on Binary Texts.- On the Suffix Automaton with Mismatches.- On String Matching in Chunked Texts.- Factor Automata of Automata and Applications.- Subset Seed Automaton.- A Measure for the Degree of Nondeterminism of Context-Free Languages.- Efficient Computation of Throughput Values of Context-Free Languages.- Analyzing Ambiguity of Context-Free Grammars.- Efficient Enumeration of Regular Languages.- Multi-grain Relations.- Memory Reduction for Strategies in Infinite Games.- Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms.- Finite State Automata Representing Two-Dimensional Subshifts.- Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages.- Poster Abstracts.- REGAL: A Library to Randomly and Exhaustively Generate Automata.- A Finite-State Super-Chunker.- The Constrained Longest Common Subsequence Problem for Degenerate Strings.- Finite Automata Accepting Star-Connected Languages.- Efficiently Matching withLocal Grammars Using Prefix Overlay Transducers.- Significant Subpatterns Matching.- A New Method for Compiling Parallel Replacement Rules.