Derick Wood,
Sheng Yu
Springer Berlin Heidelberg
1998e druk, 1998
9783540646945
Automata Implementation
Second International Workshop on Implementing Automata, WIA'97, London, Ontario, Canada, September 18-20, 1997, Revised Papers
Specificaties
Paperback, 259 blz.
|
Engels
Springer Berlin Heidelberg |
1998e druk, 1998
ISBN13: 9783540646945
Rubricering
Onderdeel van serie
Lecture Notes in Computer Science
Verwachte levertijd ongeveer 9 werkdagen
Samenvatting
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.
Specificaties
ISBN13:9783540646945
Taal:Engels
Bindwijze:paperback
Aantal pagina's:259
Uitgever:Springer Berlin Heidelberg
Druk:1998
Hoofdrubriek:Automatisering algemeen, Computer en informatica
Inhoudsopgave
WIA and theory and practice.- Construction of efficient generalized LR parsers.- Visualization of dynamic automata using Padnon.- Automata of asynchronous behaviors.- LANGAGE: A Maple package for automaton characterization of regular languages.- In vitro implementation of finite-state machines.- Implementing WS1S via finite automata: Performance issues.- Multi-tape automata for speech and language systems: A prolog implementation.- Tools to implement automata, a first step: ASTL.- Minimal separating sets for Muller automata.- Pseudo-minimal transducers: A transducer with proper elements.- Towards a meta-normal form algorithm for context-free grammars.- A rational design for a weighted finite-state transducer library.- An efficient null-free procedure for deciding regular language membership.- Operations on extended automata.- Efficient implementation of regular languages using r-AFA.- INTEX: An integrated FST toolbox.- Precise estimation of the order of local testability of a deterministic finite automaton.- Teaching theory of computation with tape machines.- The automata theory package omega.- Practical optimizations for automata.- Sorting and doubling techniques for set partitioning and automata minimization problems.