This book constitutes the thoroughly refereed revised post-workshop proceedings of the Second International Workshop on Implementing Automata, WIA'97, held in London, Ontario, Canada, in September 1997.
The book presents 21 revised full papers carefully reviewed and selected for inclusion in the book; also included is an introductory overview. The papers discuss issues involved in the implementation of automata of all types also covering aspects from areas such as natural language processing, pattern matching, speaker recognition, VLSI testing, etc. This book reflects the state-of-the-art in this emerging area of interdisciplinary research.
Author(s): Derick Wood (auth.), Derick Wood, Sheng Yu (eds.)
Series: Lecture Notes in Computer Science 1436
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1998
Language: English
Pages: 259
Tags: Computation by Abstract Devices; Mathematical Logic and Formal Languages; Artificial Intelligence (incl. Robotics); Pattern Recognition
WIA and theory and practice....Pages 1-6
Construction of efficient generalized LR parsers....Pages 7-24
Visualization of dynamic automata using Padnon....Pages 25-28
Automata of asynchronous behaviors....Pages 29-45
LANGAGE: A Maple package for automaton characterization of regular languages....Pages 46-55
In vitro implementation of finite-state machines....Pages 56-74
Implementing WS1S via finite automata: Performance issues....Pages 75-86
Multi-tape automata for speech and language systems: A prolog implementation....Pages 87-103
Tools to implement automata, a first step: ASTL....Pages 104-108
Minimal separating sets for Muller automata....Pages 109-121
Pseudo-minimal transducers: A transducer with proper elements....Pages 122-132
Towards a meta-normal form algorithm for context-free grammars....Pages 133-143
A rational design for a weighted finite-state transducer library....Pages 144-158
An efficient null-free procedure for deciding regular language membership....Pages 159-170
Operations on extended automata....Pages 171-175
Efficient implementation of regular languages using r-AFA....Pages 176-184
INTEX: An integrated FST toolbox....Pages 185-197
Precise estimation of the order of local testability of a deterministic finite automaton....Pages 198-212
Teaching theory of computation with tape machines....Pages 213-227
The automata theory package omega ....Pages 228-231
Practical optimizations for automata....Pages 232-240
Sorting and doubling techniques for set partitioning and automata minimization problems....Pages 241-251
