Skip to main content
SpringerLink
Log in

Automata Implementation

4th International Workshop on Implementing Automata, WIA'99 Potsdam, Germany, July 17-19, 2001 Revised Papers

  • Conference proceedings
  • © 2001

Overview

Editors:
  1. Oliver Boldt

    1. Universität Potsdam, Institut für Informatik, Potsdam, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Helmut Jürgensen

    1. Institut für Informatik, Universität Potsdam, Potsdam
      Department of Computer Science, 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 2214)

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

  1. Front Matter

    Pages I-VIII
    Download chapter PDF

  2. FA Minimisation Heuristics for a Class of Finite Languages

    • Jérôme Amilhastre, Philippe Janssen, Marie-Catherine Vilarem
    Pages 1-12

  3. SEA: A Symbolic Environment for Automata Theory

    • Philippe Andary, Pascal Caron, Jean-Marc Champarnaud, Gérard Duchamp, Marianne Flouret, Éric Laugerotte
    Pages 13-26

  4. Analysis of Reactive Systems with n Timers

    • Anne Bergeron, Riccardo Catalano
    Pages 27-38

  5. Animation of the Generation and Computation of Finite Automata for Learning Software

    • Beatrix Braune, Stephan Diehl, Andreas Kerren, Reinhard Wilhelm
    Pages 39-47

  6. Metric Lexical Analysis

    • Cristian S. Calude, Kai Salomaa, Sheng Yu
    Pages 48-59

  7. State Complexity of Basic Operations on Finite Languages

    • C. Câmpeanu, K. Culik II, Kai Salomaa, Sheng Yu
    Pages 60-70

  8. Treatment of Unknown Words

    • Jan Daciuk
    Pages 71-80

  9. Computing Entropy Maps of Finite-Automaton-Encoded Binary Images

    • Mark G. Eramian
    Pages 81-90

  10. Thompson Digraphs: A Characterization

    • Dora Giammarresi, Jean-Luc Ponty, Derick Wood
    Pages 91-100

  11. Finite Automata Encoding Geometric Figures

    • Helmut Jürgensen, Ludwig Staiger
    Pages 101-108

  12. Compressed Storage of Sparse Finite-State Transducers

    • George Anton Kiraz
    Pages 109-121

  13. An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing

    • Gertjan van Noord, Dale Gerdemann
    Pages 122-139

  14. Multiset Processing by Means of Systems of Finite State Transducers

    • Gheorghe Păun, Gabriel Thierrin
    Pages 140-157

  15. A Structural Method for Output Compaction of Sequential Automata Implemented as Circuits

    • M. Seuring, M. Gössel
    Pages 158-163

  16. An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata

    • A.N. Trahtman
    Pages 164-173

  17. A Taxonomy of Algorithms for Constructing Minimal Acyclic Deterministic Finite Automata

    • Bruce W. Watson
    Pages 174-182

  18. Back Matter

    Pages 183-183
    Download chapter PDF
Back to top

Keywords

Editors and Affiliations

  • Universität Potsdam, Institut für Informatik, Potsdam, Germany

    Oliver Boldt

  • Institut für Informatik, Universität Potsdam, Potsdam

    Helmut Jürgensen

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

    Helmut Jürgensen

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation