Conferences in DBLP

Conference on Implementation and Application of Automata (CIAA) (wia)
2006 (conf/wia/2006)

1. Ming Li
   Information Distance and Its Applications. [Citation Graph (0, 0)][DBLP]
   CIAA, 2006, pp:1-9 [Conf]
   
2. Grzegorz Rozenberg
   Theory Inspired by Gene Assembly in Ciliates. [Citation Graph (0, 0)][DBLP]
   CIAA, 2006, pp:10- [Conf]
   
3. Sheng Yu
   On the State Complexity of Combined Operations. [Citation Graph (0, 0)][DBLP]
   CIAA, 2006, pp:11-22 [Conf]
   
4. Mathieu Giraud, Philippe Veber, Dominique Lavenier
   Path-Equivalent Removals of epsilon-transitions in a Genomic Weighted Finite Automaton. [Citation Graph (0, 0)][DBLP]
   CIAA, 2006, pp:23-33 [Conf]
   
5. Henning Bordihn, Markus Holzer, Martin Kutrib
   Hybrid Extended Finite Automata. [Citation Graph (0, 0)][DBLP]
   CIAA, 2006, pp:34-45 [Conf]
   
6. German Tischler
   Refinement of Near Random Access Video Coding with Weighted Finite Automata. [Citation Graph (0, 0)][DBLP]
   CIAA, 2006, pp:46-57 [Conf]
   
7. Martin Simunek, Borivoj Melichar
   Borders and Finite Automata. [Citation Graph (0, 0)][DBLP]
   CIAA, 2006, pp:58-68 [Conf]
   
8. Pavlos Antoniou, Jan Holub, Costas S. Iliopoulos, Borivoj Melichar, Pierre Peterlongo
   Finding Common Motifs with Gaps Using Finite Automata. [Citation Graph (0, 0)][DBLP]
   CIAA, 2006, pp:69-77 [Conf]
   
9. Maxime Crochemore, Lucian Ilie, Emine Seid-Hilmi
   Factor Oracles. [Citation Graph (0, 0)][DBLP]
   CIAA, 2006, pp:78-89 [Conf]
   
10. Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter
    Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice. [Citation Graph (0, 0)][DBLP]
    CIAA, 2006, pp:90-101 [Conf]
    
11. Jonathan May, Kevin Knight
    Tiburon: A Weighted Tree Automata Toolkit. [Citation Graph (0, 0)][DBLP]
    CIAA, 2006, pp:102-113 [Conf]
    
12. Manuel Baclet, Claire Pagetti
    Around Hopcroft's Algorithm. [Citation Graph (0, 0)][DBLP]
    CIAA, 2006, pp:114-125 [Conf]
    
13. Florent Nicart, Jean-Marc Champarnaud, T. Csáki, Tamás Gaál, André Kempe
    Multi-tape Automata with Symbol Classes. [Citation Graph (0, 0)][DBLP]
    CIAA, 2006, pp:126-136 [Conf]
    
14. Corinna Cortes, Mehryar Mohri, Ashish Rastogi
    On the Computation of Some Standard Distances Between Probabilistic Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2006, pp:137-149 [Conf]
    
15. Andreas Maletti
    Does o-Substitution Preserve Recognizability? [Citation Graph (0, 0)][DBLP]
    CIAA, 2006, pp:150-161 [Conf]
    
16. Hartmut Messerschmidt, Frantisek Mráz, Friedrich Otto, Martin Plátek
    Correctness Preservation and Complexity of Simple RL-Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2006, pp:162-172 [Conf]
    
17. Parosh Aziz Abdulla, Lisa Kaati, Johanna Högberg
    Bisimulation Minimization of Tree Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2006, pp:173-185 [Conf]
    
18. Jens Glöckler
    Forgetting Automata and Unary Languages. [Citation Graph (0, 0)][DBLP]
    CIAA, 2006, pp:186-197 [Conf]
    
19. Hing Leung
    Structurally Unambiguous Finite Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2006, pp:198-207 [Conf]
    
20. Roderick Bloem, Alessandro Cimatti, Ingo Pill, Marco Roveri, Simone Semprini
    Symbolic Implementation of Alternating Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2006, pp:208-218 [Conf]
    
21. Yung-Pin Cheng, Hong-Yi Wang, Yu-Ru Cheng
    On-the-Fly Branching Bisimulation Minimization for Compositional Analysis. [Citation Graph (0, 0)][DBLP]
    CIAA, 2006, pp:219-229 [Conf]
    
22. Tim Fernando
    Finite-State Temporal Projection. [Citation Graph (0, 0)][DBLP]
    CIAA, 2006, pp:230-241 [Conf]
    
23. Matthieu Constant, Denis Maurel
    Compiling Linguistic Constraints into Finite State Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2006, pp:242-252 [Conf]
    
24. José Fortes Gálvez, Sylvain Schmitz, Jacques Farré
    Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time. [Citation Graph (0, 0)][DBLP]
    CIAA, 2006, pp:253-264 [Conf]
    
25. Manuel Vazquez de Parga, Pedro García, José Ruiz
    A Family of Algorithms for Non Deterministic Regular Languages Inference. [Citation Graph (0, 0)][DBLP]
    CIAA, 2006, pp:265-274 [Conf]
    
26. Ruhsan Onder, Zeki Bayram
    XSLT Version 2.0 Is Turing-Complete: A Purely Transformation Based Proof. [Citation Graph (0, 0)][DBLP]
    CIAA, 2006, pp:275-276 [Conf]
    
27. Suman Roy, Bhaskar Chakraborty
    A Finite Union of DFAs in Symbolic Model Checking of Infinite Systems. [Citation Graph (0, 0)][DBLP]
    CIAA, 2006, pp:277-278 [Conf]
    
28. Guowu Yang, Fei Xie, Xiaoyu Song, Marek A. Perkowski
    Universality of Hybrid Quantum Gates and Synthesis Without Ancilla Qudits. [Citation Graph (0, 0)][DBLP]
    CIAA, 2006, pp:279-280 [Conf]
    
29. Michael Luttenberger
    Reachability Analysis of Procedural Programs with Affine Integer Arithmetic. [Citation Graph (0, 0)][DBLP]
    CIAA, 2006, pp:281-282 [Conf]
    
30. Guillaume Bonfante, Joseph Le Roux, Guy Perrier
    Lexical Disambiguation with Polarities and Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2006, pp:283-284 [Conf]
    
31. Adrian D. Thurston
    Parsing Computer Languages with an Automaton Compiled from a Single Regular Expression. [Citation Graph (0, 0)][DBLP]
    CIAA, 2006, pp:285-286 [Conf]
    
32. Heikki Hyyrö
    Tighter Packed Bit-Parallel NFA for Approximate String Matching. [Citation Graph (0, 0)][DBLP]
    CIAA, 2006, pp:287-289 [Conf]