Automata Implementation: Third International Workshop on Implementing Automata, WIA'98, Rouen, France, September 17-19, 1998, Revised Papers

Front Cover
Springer Science & Business Media, Oct 13, 1999 - Computers - 243 pages
0 Reviews
The papers contained in this volume were presented at the third international Workshop on Implementing Automata, held September 17{19,1998, at the U- versity of Rouen, France. Automata theory is the cornerstone of computer science theory. While there is much practical experience with using automata, this work covers diverse - eas,includingparsing,computationallinguistics,speechrecognition,textsear- ing,device controllers,distributed systems, andprotocolanalysis.Consequently, techniques that have been discovered in one area may not be known in another. In addition, there is a growing number of symbolic manipulation environments designed to assist researchers in experimenting with and teaching on automata and their implementation; examples include FLAP, FADELA, AMORE, Fire- Lite, Automate, AGL, Turing’s World, FinITE, INR, and Grail. Developers of such systems have not had a forum in which to expose and compare their work. The purpose of this workshop was to bring together members of the academic, research,andindustrialcommunitieswithaninterestinimplementingautomata, to demonstrate their work and to explain the problems they have been solving. These workshops started in 1996 and 1997 at the University of Western Ontario, London, Ontario, Canada, prompted by Derick Wood and Sheng Yu. The major motivation for starting these workshops was that there had been no single forum in which automata-implementation issues had been discussed. The interest shown in the r st and second workshops demonstrated that there was a need for such a forum. The participation at the third workshop was very interesting: we counted sixty-three registrations, four continents, ten countries, twenty-three universities, and three companies.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Extended ContextFree Grammars and Normal Form Algorithms
1
On Parsing LLLanguages
13
On Parsing and Condensing Substrings of LR Languages in Linear Time
22
Minimal CoverAutomata for Finite Languages
43
Determinization of Glushkov Automata
57
Implementing Reversed Alternating Finite Automaton rAFA Operations?
69
Operations on DASG
82
Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching
92
Proving Sequential Function Chart Programs Using Automata
149
Automata and Computational Probabilities
164
Automata and Binary Decision Diagrams
178
Operations over Automata with Multiplicities
183
Paging Automata
192
On the Syntax Semantics and Implementation of a GraphBased Computational Environment
199
The Finite State Automatas Design Patterns
213
Automata to Recognize Finite and Infinite Words with at Least Two Factorizations on a Given Finite Set
220

Application to HandiAS System
100
Bidirectional Automata to Extract Complex Phrases from Texts
110
A Fast New Semiincremental Algorithm for the Construction of Minimal Acyclic DFAs
121
Using Acceptors as Transducers
133
A Graphical Version of Automate
226
A Walkthrough
230
Author Index
244
Copyright

Other editions - View all

Common terms and phrases