Implementation and Application of Automata
Subtitle: 5th International Conference, CIAA 2000, London, Ontario, Canada, July 24-25, 2000, Revised Papers (Lecture Notes in Computer Science)
Contributors: Sheng Yu (Editor); Andrei Paun (Editor)
Edition: 1 edition
Publisher: Springer
Published: September 21, 2001
Language: eng
Format: Paperback
Number of pages: 343
ISBN-13: 9783540424918
Subjects: Algorithms & procedures; Artificial intelligence; Computer architecture & logic design; Computers - General Information; Automata; Computers; Computer Books: General; Machine theory; Congresses; Artificial Intelligence - General; Computer Science; General; Automata Computations; Automata Theory; Cellular Automata; Computers / Computer Science; Formal Languages; Formal Methods; Foundations; Implementation
First sentence: Message sequence charts (MSCs) are a popular means for specifying scenarios that capture the communication between processes or objects.
Description: Implementation and Application of Automata: 5th International Conference, CIAA 2000 London, Ontario, Canada, July 24–25, 2000 Revised Papers<br />Author: Shen Yu, Andrei Păun<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-42491-8<br /> DOI: 10.1007/3-540-44674-5<br /><br />Table of Contents:<p></p><ul><li>Synthesizing State-Based Object Systems from LSC Specifications
</li><li>Applications of Finite-State Transducers in Natural Language Processing
</li><li>Fast Implementations of Automata Computations
</li><li>Regularly Extended Two-Way Nondeterministic Tree Automata
</li><li>Glushkov Construction for Multiplicities
</li><li>Implicit Structures to Implement NFA’s from Regular Expressions
</li><li>New Finite Automaton Constructions Based on Canonical Derivatives
</li><li>Experiments with Automata Compression
</li><li>Computing Raster Images from Grid Picture Grammars
</li><li>A Basis for Looping Extensions to Discriminating-Reverse Parsing
</li><li>Automata for Pro-V Topologies
</li><li>Reachability and Safety in Queue Systems
</li><li>Generalizing the Discrete Timed Automaton
</li><li>Factorization of Ambiguous Finite-State Transducers
</li><li>MONA Implementation Secrets
</li><li>Cursors
</li><li>An Automaton Model of User-Controlled Navigation on the Web
</li><li>Direct Construction of Minimal Acyclic Subsequential Transducers
</li><li>Generic ε-Removal Algorithm for Weighted Automata
</li><li>An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages</li></ul>