Implementation and Application of Automata
Springer Berlin (Verlag)
978-3-540-76335-2 (ISBN)
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.
| Erscheint lt. Verlag | 7.11.2007 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | XIII, 326 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 516 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik | |
| Schlagworte | Algorithm analysis and problem complexity • Alphabet • Automata • automata implementations • Automata Theory • Bioinformatics • bisimulation • chip design • Complexity theory • Context-free Grammar • Decidability • Determinism • Finite Automata • Finite-State Systems • finite-state transducers • Foundations • grammar • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Information Retrieval • Membrane computing • Model Checking • Natural Language Processing • Pattern Matching • probabilistic automata • reduction • Regular Expressions • regular languages • Simulation • string processing • text indexing • Tree automata • Weighted Automata • XML processing |
| ISBN-10 | 3-540-76335-X / 354076335X |
| ISBN-13 | 978-3-540-76335-2 / 9783540763352 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
