Skip to main content
SpringerLink
Log in
Book cover

Implementation and Application of Automata

10th International Conference, CIAA 2005, Sophia Antipolis, France, June 27-29, 2005, Revised Selected Papers

  • Conference proceedings
  • © 2006

Overview

Editors:
  1. Jacques Farré

    1. Sophia Antipolis, Laboratoire I3S, Les Algorithmes - bât. Euclide B, Université de Nice, Sophia Antipolis - Cedex, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Igor Litovsky

    1. Sophia Antipolis, Ecole Polytechnique, Université de Nice, Sophia Antipolis - Cedex, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Sylvain Schmitz

    1. Laboratoire I3S, Université de Nice, Sophia Antipolis & CNRS, 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 3845)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: CIAA 2005.

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

  1. Front Matter

    Download chapter PDF

  2. Invited Lectures

    1. Languages Recognizable by Quantum Finite Automata

      • Rūsiņš Freivalds
      Pages 1-14

    2. The Language, the Expression, and the (Small) Automaton

      • Jacques Sakarovitch
      Pages 15-30

  3. Technical Contributions

    1. Minimization of Non-deterministic Automata with Large Alphabets

      • Parosh Aziz Abdulla, Johann Deneux, Lisa Kaati, Marcus Nilsson
      Pages 31-42

    2. Simulating Two-Dimensional Recognizability by Pushdown and Queue Automata

      • Marcella Anselmo, Maria Madonia
      Pages 43-53

    3. Component Composition Preserving Behavioural Contracts Based on Communication Traces

      • Arnaud Bailly, Mireille Clerbout, Isabelle Simplot-Ryl
      Pages 54-65

    4. Strong Retiming Equivalence of Synchronous Schemes

      • Miklós Bartha
      Pages 66-77

    5. Prime Normal Form and Equivalence of Simple Grammars

      • Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter
      Pages 78-89

    6. An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata

      • Cezar Câmpeanu, Andrei Păun, Jason R. Smith
      Pages 90-103

    7. Finite Automata and Unions of Regular Patterns with Bounded Constant Segments

      • Antonio Cano, Pedro García
      Pages 104-115

    8. Inside Vaucanson

      • Thomas Claveirole, Sylvain Lombardy, Sarah O’Connor, Louis-Noël Pouchet, Jacques Sakarovitch
      Pages 116-128

    9. Deterministic Recognition of Trees Accepted by a Linear Pushdown Tree Automaton

      • Akio Fujiyoshi, Ikuo Kawaharada
      Pages 129-140

    10. Shorter Regular Expressions from Finite-State Automata

      • Yo-Sub Han, Derick Wood
      Pages 141-152

    11. Wind in the Willows – Generating Music by Means of Tree Transducers

      • Johanna Högberg
      Pages 153-162

    12. On Deterministic Catalytic Systems

      • Oscar H. Ibarra, Hsu-Chun Yen
      Pages 163-175

    13. Restricting the Use of Auxiliary Symbols for Restarting Automata

      • Tomasz Jurdziński, Friedrich Otto
      Pages 176-187

    14. A Class of Rational n-WFSM Auto-intersections

      • André Kempe, Jean-Marc Champarnaud, Jason Eisner, Franck Guingne, Florent Nicart
      Pages 188-198

    15. Experiments with Deterministic ω-Automata for Formulas of Linear Temporal Logic

      • Joachim Klein, Christel Baier
      Pages 199-212

    16. Computing Affine Hulls over \({\mathbb Q}\) and \({\mathbb Z}\) from Sets Represented by Number Decision Diagrams

      • Louis Latour
      Pages 213-224

    17. Tree Automata and XPath on Compressed Trees

      • Markus Lohrey, Sebastian Maneth
      Pages 225-237
Back to top

Other volumes

  1. Implementation and Application of Automata

Keywords

Editors and Affiliations

  • Sophia Antipolis, Laboratoire I3S, Les Algorithmes - bât. Euclide B, Université de Nice, Sophia Antipolis - Cedex, France

    Jacques Farré

  • Sophia Antipolis, Ecole Polytechnique, Université de Nice, Sophia Antipolis - Cedex, France

    Igor Litovsky

  • Laboratoire I3S, Université de Nice, Sophia Antipolis & CNRS, France

    Sylvain Schmitz

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation