Implementation and Application of Automata

1. Contributed Papers

   1. State Complexity and the Monoid of Transformations of a Finite Set

      • Bryan Krawetz, John Lawrence, Jeffrey Shallit

      Pages 213-224

   2. An Application of Quantum Finite Automata to Interactive Proof Systems (Extended Abstract)

      • Harumichi Nishimura, Tomoyuki Yamakami

      Pages 225-236

   3. Time and Space Efficient Algorithms for Constrained Sequence Alignment

      • Z. S. Peng, H. F. Ting

      Pages 237-246

   4. Stochastic Context-Free Graph Grammars for Glycoprotein Modelling

      • Baozhen Shan

      Pages 247-258

   5. Parametric Weighted Finite Automata for Figure Drawing

      • German Tischler

      Pages 259-268

   6. Regional Finite-State Error Repair

      • Manuel Vilares, Juan Otero, Jorge Graña

      Pages 269-280

   7. Approximating Dependency Grammars Through Intersection of Regular Languages

      • Anssi Yli-Jyrä

      Pages 281-292

   8. On the Equivalence-Checking Problem for a Model of Programs Related With Multi-tape Automata

      • Vladimir Zakharov, Ivan Zakharyaschev

      Pages 293-305

2. Poster Papers

   1. Tight Bounds for NFA to DFCA Transformations for Binary Alphabets

      • Cezar Câmpeanu, Andrei Păun

      Pages 306-307

   2. Simulating the Process of Gene Assembly in Ciliates

      • Liliana Cojocaru

      Pages 308-309

   3. A BDD-Like Implementation of an Automata Package

      • Jean-Michel Couvreur

      Pages 310-311

   4. Approximation to the Smallest Regular Expression for a Given Regular Language

      • Manuel Delgado, José Morais

      Pages 312-314

   5. Algebraic Hierarchical Decomposition of Finite State Automata: Comparison of Implementations for Krohn-Rhodes Theory

      • Attila Egri-Nagy, Chrystopher L. Nehaniv

      Pages 315-316

   6. Does Hausdorff Dimension Measure Texture Complexity?

      • Mark G. Eramian, Matthew Drotar

      Pages 317-318

   7. Combining Regular Expressions with (Near-)Optimal Brzozowski Automata

      • Michiel Frishert, Bruce W. Watson

      Pages 319-320

   8. From Automata to Semilinear Sets: A Logical Solution for Sets \(\mathcal{L}\)(\(\mathcal{C}\),\(\mathcal{P}\))

      • Denis Lugiez

      Pages 321-322

   9. Myhill-Nerode Theorem for Sequential Transducers over Unique GCD-Monoids

      • Andreas Maletti

      Pages 323-324

   10. Minimalizations of NFA Using the Universal Automaton

       • Libor Polák

       Pages 325-326

   11. Two-Dimensional Pattern Matching by Two-Dimensional Online Tessellation Automata

       • Tomáš Polcar, Bořivoj Melichar

       Pages 327-328

   12. Size Reduction of Multitape Automata

       • Hellis Tamm, Matti Nykänen, Esko Ukkonen

       Pages 329-330

This volume of Lecture Notes in Computer Science contains the revised versions of the papers presented at the 9th International Conference on Implemen- tion and Application of Automata, CIAA 2004. Also included are the extended abstracts of the posters accepted to the conference. The conference was held at Queen’s University in Kingston, Ontario, Canada on July 22–24, 2004. As for its predecessors, the theme of CIAA 2004 was the implementation of automata and grammars of all types and their application in other ?elds. The topics of the papers presented at the conference range from applications of automata in natural language and speech processing to protein sequencingandgenecompression,andfromstatecomplexityandnewalgorithms for automata operations to applications of quantum ?nite automata. The25regularpapersand14posterpaperswereselectedfrom62submissions totheconference.EachsubmittedpaperwasevaluatedbyatleastthreeProgram Committee members, with the help of external referees. Based on the referee reports, the paper “Substitutions, Trajectories and Noisy Channels” by L. Kari, S. Konstantinidis and P. Sos´ ?k was chosen as the winner of the CIAA 2004 Best Paper Award. The award is sponsored by the University of California at Santa Barbara. The authors of the papers presented here come from the following countries and regions: Austria, Canada, Czech Republic, Finland, France, Germany, Hong Kong, Netherlands, Portugal, Russia, Slovakia, South Africa, Spain, UK, and USA.

• Alphabet
• Pattern Matching
• algorithms
• automata
• complexity
• complexity theory
• concatenation state machines
• finite automata
• finite-state systems
• gene compression
• grammar
• modeling
• regular expressions
• speech processing
• term rewriting
• algorithm analysis and problem complexity

• Department of Computer Science, University of Manitoba, Winnipeg, Canada

  Michael Domaratzki

• Department of Mathematics, University of Turku, Finland

  Alexander Okhotin

• School of Computing, Queen’s University, Kingston, Ontario, Canada

  Kai Salomaa

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

  Sheng Yu

Policies and ethics