Automata Implementation Second International Workshop on Implementing Automata, WIA'97, London, Ontario, Canada, September 18-20, 1997, Revised Papers /

Automata Implementation Second International Workshop on Implementing Automata, WIA'97, London, Ontario, Canada, September 18-20, 1997, Revised Papers /

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 th...

Full description

Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Wood, Derick (Editor, http://id.loc.gov/vocabulary/relators/edt), Yu, Sheng (Editor, http://id.loc.gov/vocabulary/relators/edt)
Format: Electronic eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1998.
Edition:1st ed. 1998.
Series:Lecture Notes in Computer Science, 1436
Subjects:
Artificial intelligence.
Computers.
Mathematical logic.
Pattern recognition.
Artificial Intelligence.
Computation by Abstract Devices.
Mathematical Logic and Formal Languages.
Pattern Recognition.
Online Access:Full Text via HEAL-Link
Table of 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.

Similar Items