Advertisement

Table of contents

  1. Front Matter
    PDF
  2. WIA and theory and practice
    Derick Wood
    Pages 1-6
  3. Construction of efficient generalized LR parsers
    Miguel A. Alonso, David Cabrero, Manuel Vilares
    Pages 7-24
  4. Visualization of dynamic automata using Padnon
    François Bertault, Gregory Kucherov
    Pages 25-28
  5. Automata of asynchronous behaviors
    J. A. Brzozowski, R. Negulescu
    Pages 29-45
  6. LANGAGE: A Maple package for automaton characterization of regular languages
    Pascal Caron
    Pages 46-55
  7. In vitro implementation of finite-state machines
    M. Garzon, Y. Gao, J. A. Rose, R. C. Murphy, R. Deaton, D. R. Franceschetti et al.
    Pages 56-74
  8. Implementing WS1S via finite automata: Performance issues
    James Glenn, William Gasarch
    Pages 75-86
  9. Multi-tape automata for speech and language systems: A prolog implementation
    George Anton Kiraz, Edmund Grimley-Evans
    Pages 87-103
  10. Tools to implement automata, a first step: ASTL
    Vincent Le Maout
    Pages 104-108
  11. Minimal separating sets for Muller automata
    Helmut Lescow, Jens Vöge
    Pages 109-121
  12. Pseudo-minimal transducers: A transducer with proper elements
    Denis Maurel, Laurent Chauvier
    Pages 122-132
  13. Towards a meta-normal form algorithm for context-free grammars
    Charlotte L. Miller
    Pages 133-143
  14. A rational design for a weighted finite-state transducer library
    Mehryar Mohri, Fernando Pereira, Michael Riley
    Pages 144-158
  15. An efficient null-free procedure for deciding regular language membership
    J. -L. Ponty
    Pages 159-170
  16. Operations on extended automata
    Dominique Revuz
    Pages 171-175
  17. Efficient implementation of regular languages using r-AFA
    K. Salomaa, X. Wu, S. Yu
    Pages 176-184
  18. INTEX: An integrated FST toolbox
    Max Silberztein
    Pages 185-197
  19. Precise estimation of the order of local testability of a deterministic finite automaton
    A. N. Trahtman
    Pages 198-212
  20. Teaching theory of computation with tape machines
    Y. Velinov
    Pages 213-227
  21. The automata theory package omega
    J. Vöge, S. Ulbrand, O. Matz, N. Buhrke
    Pages 228-231
  22. Practical optimizations for automata
    Bruce W. Watson
    Pages 232-240
  23. Sorting and doubling techniques for set partitioning and automata minimization problems
    D. Ziadi
    Pages 241-251
  24. Back Matter
    PDF

About these proceedings

Introduction

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.

Keywords

Automata Implementation Contetxt Free Grammars Finite-State Machines Formal languages Pattern Matching Performance Processing Text algorithms cognition finite automata grammar natural language optimization

Bibliographic information

  • DOI https://doi.org/10.1007/BFb0031375
  • Copyright Information Springer-Verlag Berlin Heidelberg 1998
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-64694-5
  • Online ISBN 978-3-540-69104-4
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site