12. CIAA 2007: Praque, Czech Republic

Invited Talks

• Gheorghe Paun:
  Spiking Neural P Systems Used as Acceptors and Transducers. 1-4
  
• Moshe Y. Vardi:
  Linear-Time Model Checking: Automata Theory in Practice. 5-10
  
• Cyril Allauzen, Michael Riley, Johan Schalkwyk, Wojciech Skut, Mehryar Mohri:
  OpenFst: A General and Efficient Weighted Finite-State Transducer Library. 11-23
  
• Bruce W. Watson:
  Automata Applications in Chip-Design Software. 24-26
  

Contributed Talks

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

Poster Abstracts

• Frédérique Bassino, Julien David, Cyril Nicaud:
  : A Library to Randomly and Exhaustively Generate Automata. 303-305
  
• Olivier Blanc, Matthieu Constant, Patrick Watrin:
  A Finite-State Super-Chunker. 306-308
  
• Costas S. Iliopoulos, M. Sohel Rahman, Michal Vorácek, Ladislav Vagner:
  The Constrained Longest Common Subsequence Problem for Degenerate Strings. 309-311
  
• Barbara Klunder:
  Finite Automata Accepting Star-Connected Languages. 312-313
  
• Clemens Marschner:
  Efficiently Matching with Local Grammars Using Prefix Overlay Transducers. 314-316
  
• Jan Supol:
  Significant Subpatterns Matching. 317-319
  
• Anssi Yli-Jyrä, Kimmo Koskenniemi:
  A New Method for Compiling Parallel Replacement Rules. 320-321
  

Last update Fri May 25 08:48:55 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page