Skip to main content
  • Conference proceedings
  • © 2006

Implementation and Application of Automata

11th International Conference, CIAA 2006, Taipei, Taiwan, August 21-23, 2006, Proceedings

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

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

Conference series link(s): CIAA: International Conference on Implementation and Application of Automata

Conference proceedings info: CIAA 2006.

Buy it now

Buying options

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

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

Table of contents (32 papers)

  1. Front Matter

  2. Invited Lectures

    1. Theory Inspired by Gene Assembly in Ciliates

      • Grzegorz Rozenberg
      Pages 10-10
  3. Technical Contributions

    1. Path-Equivalent Removals of ε-transitions in a Genomic Weighted Finite Automaton

      • Mathieu Giraud, Philippe Veber, Dominique Lavenier
      Pages 23-33
    2. Hybrid Extended Finite Automata

      • Henning Bordihn, Markus Holzer, Martin Kutrib
      Pages 34-45
    3. Borders and Finite Automata

      • Martin Å imůnek, BoÅ™ivoj Melichar
      Pages 58-68
    4. Finding Common Motifs with Gaps Using Finite Automata

      • Pavlos Antoniou, Jan Holub, Costas S. Iliopoulos, BoÅ™ivoj Melichar, Pierre Peterlongo
      Pages 69-77
    5. Factor Oracles

      • Maxime Crochemore, Lucian Ilie, Emine Seid-Hilmi
      Pages 78-89
    6. Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice

      • Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter
      Pages 90-101
    7. Tiburon: A Weighted Tree Automata Toolkit

      • Jonathan May, Kevin Knight
      Pages 102-113
    8. Around Hopcroft’s Algorithm

      • Manuel Baclet, Claire Pagetti
      Pages 114-125
    9. Multi-tape Automata with Symbol Classes

      • F. Nicart, J. -M. Champarnaud, T. Csáki, T. Gaál, A. Kempe
      Pages 126-136
    10. On the Computation of Some Standard Distances Between Probabilistic Automata

      • Corinna Cortes, Mehryar Mohri, Ashish Rastogi
      Pages 137-149
    11. Does o-Substitution Preserve Recognizability?

      • Andreas Maletti
      Pages 150-161
    12. Correctness Preservation and Complexity of Simple RL-Automata

      • H. Messerschmidt, F. Mráz, F. Otto, M. Plátek
      Pages 162-172
    13. Bisimulation Minimization of Tree Automata

      • Parosh Aziz Abdulla, Lisa Kaati, Johanna Högberg
      Pages 173-185
    14. Forgetting Automata and Unary Languages

      • Jens Glöckler
      Pages 186-197
    15. Structurally Unambiguous Finite Automata

      • Hing Leung
      Pages 198-207

Other Volumes

  1. Implementation and Application of Automata

Editors and Affiliations

  • Department of Computer Science, University of California, Santa Barbara

    Oscar H. Ibarra

  • Dept. of Computer Science, Kainan University, Taoyuan, Taiwan, R.O.C.

    Hsu-Chun Yen

Bibliographic Information

Buy it now

Buying options

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