1 option
Automata Implementation : Second International Workshop on Implementing Automata, WIA'97, London, Ontario, Canada, September 18-20, 1997, Revised Papers / edited by Derick Wood, Sheng Yu.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 1436.
- Lecture Notes in Computer Science, 0302-9743 ; 1436
- Language:
- English
- Subjects (All):
- Artificial intelligence.
- Computers.
- Logic, Symbolic and mathematical.
- Pattern perception.
- Artificial Intelligence.
- Computation by Abstract Devices.
- Mathematical Logic and Formal Languages.
- Pattern Recognition.
- Local Subjects:
- Artificial Intelligence.
- Computation by Abstract Devices.
- Mathematical Logic and Formal Languages.
- Pattern Recognition.
- Physical Description:
- 1 online resource (IX, 259 pages).
- Edition:
- First edition 1998.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1998.
- System Details:
- text file PDF
- Summary:
- 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, et cetera This book reflects the state-of-the-art in this emerging area of interdisciplinary research.
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-69104-4
- 9783540691044
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.