11. CIAA 2006: Taipei, Taiwan

Invited Lectures

• Ming Li:
  Information Distance and Its Applications. 1-9
  
• Grzegorz Rozenberg:
  Theory Inspired by Gene Assembly in Ciliates. 10
  
• Sheng Yu:
  On the State Complexity of Combined Operations. 11-22
  

Technical Contributions

• Mathieu Giraud, Philippe Veber, Dominique Lavenier:
  Path-Equivalent Removals of epsilon-transitions in a Genomic Weighted Finite Automaton. 23-33
  
• Henning Bordihn, Markus Holzer, Martin Kutrib:
  Hybrid Extended Finite Automata. 34-45
  
• German Tischler:
  Refinement of Near Random Access Video Coding with Weighted Finite Automata. 46-57
  
• Martin Simunek, Borivoj Melichar:
  Borders and Finite Automata. 58-68
  
• Pavlos Antoniou, Jan Holub, Costas S. Iliopoulos, Borivoj Melichar, Pierre Peterlongo:
  Finding Common Motifs with Gaps Using Finite Automata. 69-77
  
• Maxime Crochemore, Lucian Ilie, Emine Seid-Hilmi:
  Factor Oracles. 78-89
  
• Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter:
  Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice. 90-101
  
• Jonathan May, Kevin Knight:
  Tiburon: A Weighted Tree Automata Toolkit. 102-113
  
• Manuel Baclet, Claire Pagetti:
  Around Hopcroft's Algorithm. 114-125
  
• Florent Nicart, Jean-Marc Champarnaud, Tibor Csáki, Tamás Gaál, André Kempe:
  Multi-tape Automata with Symbol Classes. 126-136
  
• Corinna Cortes, Mehryar Mohri, Ashish Rastogi:
  On the Computation of Some Standard Distances Between Probabilistic Automata. 137-149
  
• Andreas Maletti:
  Does o-Substitution Preserve Recognizability? 150-161
  
• Hartmut Messerschmidt, Frantisek Mráz, Friedrich Otto, Martin Plátek:
  Correctness Preservation and Complexity of Simple RL-Automata. 162-172
  
• Parosh Aziz Abdulla, Lisa Kaati, Johanna Högberg:
  Bisimulation Minimization of Tree Automata. 173-185
  
• Jens Glöckler:
  Forgetting Automata and Unary Languages. 186-197
  
• Hing Leung:
  Structurally Unambiguous Finite Automata. 198-207
  
• Roderick Bloem, Alessandro Cimatti, Ingo Pill, Marco Roveri, Simone Semprini:
  Symbolic Implementation of Alternating Automata. 208-218
  
• Yung-Pin Cheng, Hong-Yi Wang, Yu-Ru Cheng:
  On-the-Fly Branching Bisimulation Minimization for Compositional Analysis. 219-229
  
• Tim Fernando:
  Finite-State Temporal Projection. 230-241
  
• Matthieu Constant, Denis Maurel:
  Compiling Linguistic Constraints into Finite State Automata. 242-252
  
• José Fortes Gálvez, Sylvain Schmitz, Jacques Farré:
  Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time. 253-264
  
• Manuel Vazquez de Parga, Pedro García, José Ruiz:
  A Family of Algorithms for Non Deterministic Regular Languages Inference. 265-274
  

Poster Abstracts

• Ruhsan Onder, Zeki Bayram:
  XSLT Version 2.0 Is Turing-Complete: A Purely Transformation Based Proof. 275-276
  
• Suman Roy, Bhaskar Chakraborty:
  A Finite Union of DFAs in Symbolic Model Checking of Infinite Systems. 277-278
  
• Guowu Yang, Fei Xie, Xiaoyu Song, Marek A. Perkowski:
  Universality of Hybrid Quantum Gates and Synthesis Without Ancilla Qudits. 279-280
  
• Michael Luttenberger:
  Reachability Analysis of Procedural Programs with Affine Integer Arithmetic. 281-282
  
• Guillaume Bonfante, Joseph Le Roux, Guy Perrier:
  Lexical Disambiguation with Polarities and Automata. 283-284
  
• Adrian D. Thurston:
  Parsing Computer Languages with an Automaton Compiled from a Single Regular Expression. 285-286
  
• Heikki Hyyrö:
  Tighter Packed Bit-Parallel NFA for Approximate String Matching. 287-289
  

Last update Thu May 23 18:08:55 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page