Implementation and Application of Automata
Springer Berlin (Verlag)
978-3-540-40391-3 (ISBN)
The 28 revised full papers presented together with an invited paper and 4 short papers were carefully selected during two rounds of reviewing and revision. The topics addressed range from theoretical and methodological issues to automata applications in software engineering, natural language processing, speech recognition, and image processing, to new representations and algorithms for efficient implementation of automata and related structures.
Invited Lecture.- Edit-Distance of Weighted Automata.- Technical Contributions.- p-Subsequentiable Transducers.- Bidirectional Push Down Automata.- Finite Automata and Non-self-Embedding Grammars.- Simulation of Gate Circuits in the Algebra of Transients.- The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata.- Regex and Extended Regex.- Prime Decompositions of Regular Prefix Codes.- Implementation of Dictionaries via Automata and Decision Trees.- Feedback-Free Circuits in the Algebra of Transients.- On Minimizing Cover Automata for Finite Languages in O(n log n) Time.- Compilation of Constraint-Based Contextual Rules for Part-of-Speech Tagging into Finite State Transducers.- Finite State Lazy Operations in NLP.- State Complexity of Basic Operations on Nondeterministic Finite Automata.- Adaptive Automata - A Revisited Proposal.- Efficient Automaton-Based Recognition for Linear Conjunctive Languages.- Syntactic Semiring and Language Equations.- Reduced Power Automata.- A Polynomial Time Algorithm for Left [Right] Local Testability.- Whale Calf, a Parser Generator for Conjunctive Grammars.- automata, a Hybrid System for Computational Automata Theory.- A Package TESTAS for Checking Some Kinds of Testability.- DAWG versus Suffix Array.- On Predictive Parsing and Extended Context-Free Grammars.- Star Normal Form, Rational Expressions, and Glushkov WFAs Properties.- Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings.- Term Validation of Distributed Hard Real-Time Applications.- Common Subsequence Automaton.- Searching for Asymptotic Error Repair.- Abstracts.- Automata-Based Representations for Arithmetic Constraints in Automated Verification.- On the Implementation ofCompact DAWG's.- Dynamic Programming - NFA Simulation.- Deterministic Parsing of Cyclic Strings.
| Erscheint lt. Verlag | 23.6.2003 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science |
| Zusatzinfo | XI, 310 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 233 mm |
| Gewicht | 458 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik | |
| Schlagworte | Algorithm analysis and problem complexity • algorithms • Automata • Automata Computations • Automata Theory • Cellular Automata • Complexity • Finite Automata • Formal Languages • formal methods • Foundations • grammar systems • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Image Processing • Implementations • natural language • Natural Language Processing • Process Algebras • protocols • Simulation • Statecharts • State Complexity • verification |
| ISBN-10 | 3-540-40391-4 / 3540403914 |
| ISBN-13 | 978-3-540-40391-3 / 9783540403913 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
