Skip to main content
SpringerLink
Log in

Implementation and Application of Automata

5th International Conference, CIAA 2000, London, Ontario, Canada, July 24-25, 2000, Revised Papers

  • Conference proceedings
  • © 2001

Overview

Editors:
  1. Shen Yu

    1. Department of Computer Science, Middlesex College, The University of Western Ontario, London, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Andrei Păun

    1. Department of Computer Science, Middlesex College, The University of Western Ontario, London, Canada

    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 2088)

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 (35 papers)

  1. Front Matter

    Pages I-XI
    Download chapter PDF

  3. Technical Contributions

    1. Fast Implementations of Automata Computations

      • Anne Bergeron, Sylvie Hamel
      Pages 47-56

    2. Regularly Extended Two-Way Nondeterministic Tree Automata

      • Anne Brüggemann-Klein, Derick Wood
      Pages 57-66

    3. Glushkov Construction for Multiplicities

      • Pascal Caron, Marianne Flouret
      Pages 67-79

    4. Implicit Structures to Implement NFA’s from Regular Expressions

      • Jean-Marc Champarnaud
      Pages 80-93

    5. New Finite Automaton Constructions Based on Canonical Derivatives

      • Jean-Marc Champarnaud, D. Ziadi
      Pages 94-104

    6. Experiments with Automata Compression

      • Jan Daciuk
      Pages 105-112

    7. Computing Raster Images from Grid Picture Grammars

      • Frank Drewes, Sigrid Ewert, Renate Klempien-Hinrichs, Hans-Jörg Kreowski
      Pages 113-121

    8. A Basis for Looping Extensions to Discriminating-Reverse Parsing

      • Jacques Farré, José Fortes Gálvez
      Pages 122-134

    9. Automata for Pro-V Topologies

      • Pierre-Cyrille Héam
      Pages 135-144

    10. Reachability and Safety in Queue Systems

      • Oscar H. Ibarra
      Pages 145-156

    11. Generalizing the Discrete Timed Automaton

      • Oscar H. Ibarra, Jianwen Su
      Pages 157-169

    12. Factorization of Ambiguous Finite-State Transducers

      • André Kempe
      Pages 170-181

    13. MONA Implementation Secrets

      • Nils Klarlund, Anders Møller, Michael I. Schwartzbach
      Pages 182-194

    14. Cursors

      • Vincent Le Maout
      Pages 195-207

    15. An Automaton Model of User-Controlled Navigation on the Web

      • K. Lodaya, R. Ramanujam
      Pages 208-216

    16. Direct Construction of Minimal Acyclic Subsequential Transducers

      • Stoyan Mihov, Denis Maurel
      Pages 217-229

    17. Generic ε-Removal Algorithm for Weighted Automata

      • Mehryar Mohri
      Pages 230-242
Back to top

Keywords

About this book

The Fifth International Conference on Implementation and Application of - tomata (CIAA 2000) was held at the University of Western Ontario in London, Ontario, Canada on July 24-25, 2000. This conference series was formerly called the International Workshop on Implementing Automata (WIA) This volume of the Lecture Notes in Computer Science series contains all the papers that were presented at CIAA 2000, and also the abstracts of the poster papers that were displayed during the conference. The conference addressed issues in automata application and implemen- tion. The topics of the papers presented at this conference ranged from automata applications in software engineering, natural language and speech recognition, and image processing, to new representations and algorithms for e cient imp- mentation of automata and related structures. Automata theory is one of the oldest areas in computer science. Research in automata theory has always been motivated by its applications since its early stages of development. In the 1960s and 1970s, automata research was moti- ted heavily by problems arising from compiler construction, circuit design, string matching, etc. In recent years, many new applications have been found in various areas of computer science as well as in other disciplines. Examples of the new applications include statecharts in object-oriented modeling, nite transducers in natural language processing, and nondeterministic nite-state models in c- munication protocols. Many of the new applications do not and cannot simply apply the existing models and algorithms in automata theory to their problems.

Editors and Affiliations

  • Department of Computer Science, Middlesex College, The University of Western Ontario, London, Canada

    Shen Yu, Andrei Păun

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation