12. CIAA 2007:
Praque,
Czech Republic
Jan Holub, Jan Zdárek (Eds.):
Implementation and Application of Automata, 12th International Conference, CIAA 2007, Praque, Czech Republic, July 16-18, 2007, Revised Selected Papers.
Lecture Notes in Computer Science 4783 Springer 2007, ISBN 978-3-540-76335-2 BibTeX
Invited Talks
Contributed Talks
- Mikhail V. Volkov:
Synchronizing Automata Preserving a Chain of Partial Orders.
27-37
Electronic Edition (link) BibTeX
- Jean-Marc Champarnaud, Franck Guingne, Jacques Farré:
Reducing Acyclic Cover Transducers.
38-50
Electronic Edition (link) BibTeX
- Joachim Klein, Christel Baier:
On-the-Fly Stuttering in the Construction of Deterministic omega -Automata.
51-61
Electronic Edition (link) BibTeX
- Massimiliano Goldwurm, Roberto Radicioni:
Average Value and Variance of Pattern Statistics in Rational Models.
62-72
Electronic Edition (link) BibTeX
- Manfred Droste, George Rahonis:
Weighted Automata and Weighted Logics with Discounting.
73-84
Electronic Edition (link) BibTeX
- Martin Kutrib, Andreas Malcher, Larissa Werlein:
Regulated Nondeterminism in Pushdown Automata.
85-96
Electronic Edition (link) BibTeX
- Kai Salomaa, Sheng Yu, Jinfeng Zan:
Deterministic Caterpillar Expressions.
97-108
Electronic Edition (link) BibTeX
- Johanna Högberg, Andreas Maletti, Jonathan May:
Backward and Forward Bisimulation Minimisation of Tree Automata.
109-121
Electronic Edition (link) BibTeX
- Rafael C. Carrasco, Jan Daciuk, Mikel L. Forcada:
An Implementation of Deterministic Tree Automata Minimization.
122-129
Electronic Edition (link) BibTeX
- Shmuel Tomi Klein, Miri Ben-Nissan:
Accelerating Boyer Moore Searches on Binary Texts.
130-143
Electronic Edition (link) BibTeX
- Maxime Crochemore, Chiara Epifanio, Alessandra Gabriele, Filippo Mignosi:
On the Suffix Automaton with Mismatches.
144-156
Electronic Edition (link) BibTeX
- Hannu Peltola, Jorma Tarhio:
On String Matching in Chunked Texts.
157-167
Electronic Edition (link) BibTeX
- Mehryar Mohri, Pedro Moreno, Eugene Weinstein:
Factor Automata of Automata and Applications.
168-179
Electronic Edition (link) BibTeX
- Gregory Kucherov, Laurent Noé, Mikhail A. Roytberg:
Subset Seed Automaton.
180-191
Electronic Edition (link) BibTeX
- Frantisek Mráz, Martin Plátek, Friedrich Otto:
A Measure for the Degree of Nondeterminism of Context-Free Languages.
192-202
Electronic Edition (link) BibTeX
- Didier Caucal, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter:
Efficient Computation of Throughput Values of Context-Free Languages.
203-213
Electronic Edition (link) BibTeX
- Claus Brabrand, Robert Giegerich, Anders Møller:
Analyzing Ambiguity of Context-Free Grammars.
214-225
Electronic Edition (link) BibTeX
- Margareta Ackerman, Jeffrey Shallit:
Efficient Enumeration of Regular Languages.
226-242
Electronic Edition (link) BibTeX
- François Barthélemy:
Multi-grain Relations.
243-252
Electronic Edition (link) BibTeX
- Michael Holtmann, Christof Löding:
Memory Reduction for Strategies in Infinite Games.
253-264
Electronic Edition (link) BibTeX
- Magnus Steinby, Catalin Ionut Tîrnauca:
Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms.
265-276
Electronic Edition (link) BibTeX
- Natasa Jonoska, Joni Burnette Pirnot:
Finite State Automata Representing Two-Dimensional Subshifts.
277-289
Electronic Edition (link) BibTeX
- Marcella Anselmo, Dora Giammarresi, Maria Madonia:
Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages.
290-302
Electronic Edition (link) BibTeX
Poster Abstracts
Copyright © Sat May 16 23:47:51 2009
by Michael Ley (ley@uni-trier.de)
