Skip to main content
SpringerLink
Log in

Automata Implementation

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

  • Conference proceedings
  • © 1999

Overview

Editors:
  1. Jean-Marc Champarnaud

    1. Computer Science Laboratory, University of Rouen, Mont-Saint-Aignan Cedex, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Djelloul Ziadi

    1. Computer Science Laboratory, University of Rouen, Mont-Saint-Aignan Cedex, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Denis Maurel

    1. LI/E3i University of Tours, Tours, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1660)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (22 papers)

  1. Front Matter

    Pages I-X
    Download chapter PDF

  2. Extended Context-Free Grammars and Normal Form Algorithms

    • Jürgen Albert, Dora Giammaressi, Derick Wood
    Pages 1-12

  3. On Parsing LL-Languages

    • Norbert Blum
    Pages 13-21

  4. On Parsing and Condensing Substrings of LR Languages in Linear Time

    • Heiko Goeman
    Pages 22-42

  5. Minimal Cover-Automata for Finite Languages

    • Cezar Câmpeanu, Nicolae Sântean, Sheng Yu
    Pages 43-56

  6. Determinization of Glushkov Automata

    • Jean-Marc Champarnaud, Djelloul Ziadi, Jean-Luc Ponty
    Pages 57-68

  7. Implementing Reversed Alternating Finite Automaton (r-AFA) Operations

    • Sandra Huerter, Kai Salomaa, Xiuming Wu, Sheng Yu
    Pages 69-81

  8. Operations on DASG

    • Zdeněk Tronìček
    Pages 82-91

  9. Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching

    • Jan Holub, Bořivoj Melichar
    Pages 92-99

  10. The Syntactic Prediction with Token Automata: Application to HandiAS System

    • Denis Maurel, Brigitte Le Pévédic, Olivier Rousseau
    Pages 100-109

  11. Bi-directional Automata to Extract Complex Phrases from Texts

    • Thierry Poibeau
    Pages 110-120

  12. A Fast New Semi-incremental Algorithm for the Construction of Minimal Acyclic DFAs

    • Bruce W. Watson
    Pages 121-132

  13. Using Acceptors as Transducers

    • Matti Nykänen
    Pages 133-148

  14. Proving Sequential Function Chart Programs Using Automata

    • Dominique L’Her, Philippe Le Parc, Lionel Marcé
    Pages 149-163

  15. Automata and Computational Probabilities

    • Marie-Chantal Beaulieu, Anne Bergeron
    Pages 164-177

  16. Automata and Binary Decision Diagrams

    • Jean-Francis Michon, Jean-Marc Champarnaud
    Pages 178-182

  17. Operations over Automata with Multiplicities

    • Gérard Duchamp, Marianne Flouret, Éric Laugerotte
    Pages 183-191

  18. Paging Automata

    • Ricardo Ueda Karpischek
    Pages 192-198

  19. On the Syntax, Semantics, and Implementation of a Graph-Based Computational Environment

    • Yuri Velinov
    Pages 199-212

  20. The Finite State Automata’s Design Patterns

    • Sandro Pedrazzini
    Pages 213-219
Back to top

Keywords

About this book

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.

Editors and Affiliations

  • Computer Science Laboratory, University of Rouen, Mont-Saint-Aignan Cedex, France

    Jean-Marc Champarnaud, Djelloul Ziadi

  • LI/E3i University of Tours, Tours, France

    Denis Maurel

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation