13. CIAA 2008:
San Francisco,
California,
USA
Oscar H. Ibarra, Bala Ravikumar (Eds.):
Implementation and Applications of Automata, 13th International Conference, CIAA 2008, San Francisco, California, USA, July 21-24, 2008. Proceedings.
Lecture Notes in Computer Science 5148 Springer 2008, ISBN 978-3-540-70843-8 BibTeX
Invited Lectures
Technical Contributions
- Yih-Kuen Tsay, Bow-Yaw Wang:
Automated Compositional Reasoning of Intuitionistically Closed Regular Properties.
36-45
Electronic Edition (link) BibTeX
- Marco Almeida, Nelma Moreira, Rogério Reis:
Antimirov and Mosses's Rewrite System Revisited.
46-56
Electronic Edition (link) BibTeX
- Ahmed Bouajjani, Peter Habermehl, Lukás Holík, Tayssir Touili, Tomás Vojnar:
Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata.
57-67
Electronic Edition (link) BibTeX
- Jean-Marc Champarnaud, Jean-Philippe Dubernard, H. Jeanne:
Testing Whether a Binary and Prolongeable Regular Language LIs Geometrical or Not on the Minimal Deterministic Automaton of Pref(L).
68-77
Electronic Edition (link) BibTeX
- Andrei Paun, Mihaela Paun, Alfonso Rodríguez-Patón:
Hopcroft's Minimization Technique: Queues or Stacks?.
78-91
Electronic Edition (link) BibTeX
- Pedro García, Manuel Vazquez de Parga, Gloria Alvarez, José Ruiz:
Learning Regular Languages Using Nondeterministic Finite Automata.
92-101
Electronic Edition (link) BibTeX
- Kazuhiro Inaba, Haruo Hosoya, Sebastian Maneth:
Multi-Return Macro Tree Transducers.
102-111
Electronic Edition (link) BibTeX
- François Cantin, Axel Legay, Pierre Wolper:
Computing Convex Hulls by Automata Iteration.
112-121
Electronic Edition (link) BibTeX
- Takuya Nishiyama, Yasuhiko Minamide:
A Translation from the HTML DTD into a Regular Hedge Grammar.
122-131
Electronic Edition (link) BibTeX
- Andreas Maletti:
Tree-Series-to-Tree-Series Transformations.
132-140
Electronic Edition (link) BibTeX
- Ryan Dixon, Ömer Egecioglu, Timothy Sherwood:
Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning.
141-150
Electronic Edition (link) BibTeX
- Jan Lahoda, Borivoj Melichar, Jan Zdárek:
Pattern Matching in DCA Coded Text.
151-160
Electronic Edition (link) BibTeX
- Rob J. van Glabbeek, Bas Ploeger:
Five Determinisation Algorithms.
161-170
Electronic Edition (link) BibTeX
- Harald Hempel, Madlen Kimmritz:
Persistent Computations of Turing Machines.
171-180
Electronic Edition (link) BibTeX
- Egor Dolzhenko, Natasa Jonoska:
On Complexity of Two Dimensional Languages Generated by Transducers.
181-190
Electronic Edition (link) BibTeX
- Zoltán Ésik, Szabolcs Iván:
Games for Temporal Logics on Trees.
191-200
Electronic Edition (link) BibTeX
- Tetsuya Matsumoto, Kazuhito Hagio, Masayuki Takeda:
A Run-Time Efficient Implementation of Compressed Pattern Matching Automata.
201-211
Electronic Edition (link) BibTeX
- Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík, Lisa Kaati, Tomás Vojnar:
Composed Bisimulation for Tree Automata.
212-222
Electronic Edition (link) BibTeX
- Andrew Badr:
Hyper-Minimization in O(n2).
223-231
Electronic Edition (link) BibTeX
- Giovanni Pighizzini:
Deterministic Pushdown Automata and Unary Languages.
232-241
Electronic Edition (link) BibTeX
- Benoît Razet:
Finite Eilenberg Machines.
242-251
Electronic Edition (link) BibTeX
- Pawel Baturo, Marcin Piatkowski, Wojciech Rytter:
The Number of Runs in Sturmian Words.
252-261
Electronic Edition (link) BibTeX
- Cyril Allauzen, Mehryar Mohri:
3-Way Composition of Weighted Finite-State Transducers.
262-273
Electronic Edition (link) BibTeX
- Khaled El-Fakih, Nina Yevtushenko:
Progressive Solutions to FSM Equations.
274-282
Electronic Edition (link) BibTeX
- Akio Fujiyoshi:
Combination of Context-Free Grammars and Tree Automata for Unranked and Ranked Trees.
283-285
Electronic Edition (link) BibTeX
- Martin Simunek, Borivoj Melichar:
Approximate Periods with Levenshtein Distance.
286-287
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:47:51 2009
by Michael Ley (ley@uni-trier.de)
