9. CIAA 2004:
Kingston,
Ontario,
Canada
Michael Domaratzki, Alexander Okhotin, Kai Salomaa, Sheng Yu (Eds.):
Implementation and Application of Automata, 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers.
Lecture Notes in Computer Science 3317 Springer 2004, ISBN 3-540-24318-6 BibTeX
Invited Papers
Contributed Papers
- Cyril Allauzen, Mehryar Mohri, Brian Roark:
A General Weighted Grammar Library.
23-34
Electronic Edition (link) BibTeX
- Jean Berstel, Olivier Carton:
On the Complexity of Hopcroft's State Minimization Algorithm.
35-44
Electronic Edition (link) BibTeX
- Aneta Binder, Rudolf Freund, Georg Lojka, Marion Oswald:
Implementation of Catalytic P Systems.
45-56
Electronic Edition (link) BibTeX
- Björn Borchardt:
Code Selection by Tree Series Transducers.
57-67
Electronic Edition (link) BibTeX
- Henning Bordihn, Markus Holzer, Martin Kutrib:
Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages.
68-79
Electronic Edition (link) BibTeX
- Jean-Marc Champarnaud, Fabien Coulon, Thomas Paranthoën:
Brute Force Determinization of NFAs by Means of State Covers.
80-89
Electronic Edition (link) BibTeX
- Jean-Marc Champarnaud, Florent Nicart, Djelloul Ziadi:
Computing the Follow Automaton of an Expression.
90-101
Electronic Edition (link) BibTeX
- Mark Daley, Ian McQuillan:
Viral Gene Compression: Complexity and Verification.
102-112
Electronic Edition (link) BibTeX
- Wojciech Debski, Wojciech Fraczak:
Concatenation State Machines and Simple Functions.
113-124
Electronic Edition (link) BibTeX
- Michiel Frishert, Loek G. Cleophas, Bruce W. Watson:
FIRE Station: An Environment for Manipulating Finite Automata and Regular Expression Views.
125-133
Electronic Edition (link) BibTeX
- Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema:
Finding Finite Automata That Certify Termination of String Rewriting.
134-145
Electronic Edition (link) BibTeX
- Mathieu Giraud, Dominique Lavenier:
Linear Encoding Scheme for Weighted Finite Automata.
146-155
Electronic Edition (link) BibTeX
- Yo-Sub Han, Derick Wood:
The Generalization of Generalized Automata: Expression Automata.
156-166
Electronic Edition (link) BibTeX
- Yonghua Han, Bin Ma, Kaizhong Zhang:
An Automata Approach to Match Gapped Sequence Tags Against Protein Database.
167-177
Electronic Edition (link) BibTeX
- Jozef Jirásek, Galina Jirásková, Alexander Szabari:
State Complexity of Concatenation and Complementation of Regular Languages.
178-189
Electronic Edition (link) BibTeX
- Sebastian John:
Minimal Unambiguous eNFA.
190-201
Electronic Edition (link) BibTeX
- Lila Kari, Stavros Konstantinidis, Petr Sosík:
Substitutions, Trajectories and Noisy Channels.
202-212
Electronic Edition (link) BibTeX
- Bryan Krawetz, John Lawrence, Jeffrey Shallit:
State Complexity and the Monoid of Transformations of a Finite Set.
213-224
Electronic Edition (link) BibTeX
- Harumichi Nishimura, Tomoyuki Yamakami:
An Application of Quantum Finite Automata to Interactive Proof Systems.
225-236
Electronic Edition (link) BibTeX
- Z. S. Peng, H. F. Ting:
Time and Space Efficient Algorithms for Constrained Sequence Alignment.
237-246
Electronic Edition (link) BibTeX
- Baozhen Shan:
Stochastic Context-Free Graph Grammars for Glycoprotein Modelling.
247-258
Electronic Edition (link) BibTeX
- German Tischler:
Parametric Weighted Finite Automata for Figure Drawing.
259-268
Electronic Edition (link) BibTeX
- Manuel Vilares Ferro, Juan Otero, Jorge Graña Gil:
Regional Finite-State Error Repair.
269-280
Electronic Edition (link) BibTeX
- Anssi Yli-Jyrä:
Approximating Dependency Grammars Through Intersection of Regular Languages.
281-292
Electronic Edition (link) BibTeX
- Vladimir A. Zakharov, Ivan Zakharyaschev:
On the Equivalence-Checking Problem for a Model of Programs Related with Multi-tape Automata.
293-305
Electronic Edition (link) BibTeX
Poster Papers
- Cezar Câmpeanu, Andrei Paun:
Tight Bounds for NFA to DFCA Transformations for Binary Alphabets.
306-307
Electronic Edition (link) BibTeX
- Liliana Cojocaru:
Simulating the Process of Gene Assembly in Ciliates.
308-309
Electronic Edition (link) BibTeX
- Jean-Michel Couvreur:
A BDD-Like Implementation of an Automata Package.
310-311
Electronic Edition (link) BibTeX
- Manuel Delgado, José Morais:
Approximation to the Smallest Regular Expression for a Given Regular Language.
312-314
Electronic Edition (link) BibTeX
- Attila Egri-Nagy, Chrystopher L. Nehaniv:
Algebraic Hierarchical Decomposition of Finite State Automata: Comparison of Implementations for Krohn-Rhodes Theory.
315-316
Electronic Edition (link) BibTeX
- Mark G. Eramian, Matthew Drotar:
Does Hausdorff Dimension Measure Texture Complexity?.
317-318
Electronic Edition (link) BibTeX
- Michiel Frishert, Bruce W. Watson:
Combining Regular Expressions with (Near-)Optimal Brzozowski Automata.
319-320
Electronic Edition (link) BibTeX
- Denis Lugiez:
From Automata to Semilinear Sets: A Logical Solution for Sets L(C, P).
321-322
Electronic Edition (link) BibTeX
- Andreas Maletti:
Myhill-Nerode Theorem for Sequential Transducers over Unique GCD-Monoids.
323-324
Electronic Edition (link) BibTeX
- Libor Polák:
Minimalizations of NFA Using the Universal Automaton.
325-326
Electronic Edition (link) BibTeX
- Tomás Polcar, Borivoj Melichar:
Two-Dimensional Pattern Matching by Two-Dimensional Online Tessellation Automata.
327-328
Electronic Edition (link) BibTeX
- Hellis Tamm, Matti Nykänen, Esko Ukkonen:
Size Reduction of Multitape Automata.
329-330
Electronic Edition (link) BibTeX
- Gaoyan Xie, Cheng Li, Zhe Dang:
Testability of Oracle Automata.
331-332
Electronic Edition (link) BibTeX
- Lynette van Zijl:
Magic Numbers for Symmetric Difference NFAs.
333-334
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:47:52 2009
by Michael Ley (ley@uni-trier.de)
