| 2006 | A Family of Algorithms for Non Deterministic Regular Languages Inference. Manuel Vazquez de Parga, Pedro García, José Ruiz |
| 2006 | A Finite Union of DFAs in Symbolic Model Checking of Infinite Systems. Suman Roy, Bhaskar Chakraborty |
| 2006 | Around Hopcroft's Algorithm. Manuel Baclet, Claire Pagetti |
| 2006 | Bisimulation Minimization of Tree Automata. Parosh Aziz Abdulla, Lisa Kaati, Johanna Högberg |
| 2006 | Borders and Finite Automata. Martin Simunek, Borivoj Melichar |
| 2006 | Compiling Linguistic Constraints into Finite State Automata. Matthieu Constant, Denis Maurel |
| 2006 | Correctness Preservation and Complexity of Simple RL-Automata. Hartmut Messerschmidt, Frantisek Mráz, Friedrich Otto, Martin Plátek |
| 2006 | Does o-Substitution Preserve Recognizability? Andreas Maletti |
| 2006 | Factor Oracles. Maxime Crochemore, Lucian Ilie, Emine Seid-Hilmi |
| 2006 | Finding Common Motifs with Gaps Using Finite Automata. Pavlos Antoniou, Jan Holub, Costas S. Iliopoulos, Borivoj Melichar, Pierre Peterlongo |
| 2006 | Finite-State Temporal Projection. Tim Fernando |
| 2006 | Forgetting Automata and Unary Languages. Jens Glöckler |
| 2006 | Hybrid Extended Finite Automata. Henning Bordihn, Markus Holzer, Martin Kutrib |
| 2006 | Implementation and Application of Automata, 11th International Conference, CIAA 2006, Taipei, Taiwan, August 21-23, 2006, Proceedings Oscar H. Ibarra, Hsu-Chun Yen |
| 2006 | Information Distance and Its Applications. Ming Li |
| 2006 | Lexical Disambiguation with Polarities and Automata. Guillaume Bonfante, Joseph Le Roux, Guy Perrier |
| 2006 | Multi-tape Automata with Symbol Classes. Florent Nicart, Jean-Marc Champarnaud, Tibor Csáki, Tamás Gaál, André Kempe |
| 2006 | On the Computation of Some Standard Distances Between Probabilistic Automata. Corinna Cortes, Mehryar Mohri, Ashish Rastogi |
| 2006 | On the State Complexity of Combined Operations. Sheng Yu |
| 2006 | On-the-Fly Branching Bisimulation Minimization for Compositional Analysis. Yung-Pin Cheng, Hong-Yi Wang, Yu-Ru Cheng |
| 2006 | Parsing Computer Languages with an Automaton Compiled from a Single Regular Expression. Adrian D. Thurston |
| 2006 | Path-Equivalent Removals of Mathieu Giraud, Philippe Veber, Dominique Lavenier |
| 2006 | Reachability Analysis of Procedural Programs with Affine Integer Arithmetic. Michael Luttenberger |
| 2006 | Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice. Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter |
| 2006 | Refinement of Near Random Access Video Coding with Weighted Finite Automata. German Tischler |
| 2006 | Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time. José Fortes Gálvez, Sylvain Schmitz, Jacques Farré |
| 2006 | Structurally Unambiguous Finite Automata. Hing Leung |
| 2006 | Symbolic Implementation of Alternating Automata. Roderick Bloem, Alessandro Cimatti, Ingo Pill, Marco Roveri, Simone Semprini |
| 2006 | Theory Inspired by Gene Assembly in Ciliates. Grzegorz Rozenberg |
| 2006 | Tiburon: A Weighted Tree Automata Toolkit. Jonathan May, Kevin Knight |
| 2006 | Tighter Packed Bit-Parallel NFA for Approximate String Matching. Heikki Hyyrö |
| 2006 | Universality of Hybrid Quantum Gates and Synthesis Without Ancilla Qudits. Guowu Yang, Fei Xie, Xiaoyu Song, Marek A. Perkowski |
| 2006 | XSLT Version 2.0 Is Turing-Complete: A Purely Transformation Based Proof. Ruhsan Onder, Zeki Bayram |