Conferences in DBLP

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

1. Gheorghe Paun
   Spiking Neural P Systems Used as Acceptors and Transducers. [Citation Graph (0, 0)][DBLP]
   CIAA, 2007, pp:1-4 [Conf]
   
2. Moshe Y. Vardi
   Linear-Time Model Checking: Automata Theory in Practice. [Citation Graph (0, 0)][DBLP]
   CIAA, 2007, pp:5-10 [Conf]
   
3. Cyril Allauzen, Michael Riley, Johan Schalkwyk, Wojciech Skut, Mehryar Mohri
   OpenFst: A General and Efficient Weighted Finite-State Transducer Library. [Citation Graph (0, 0)][DBLP]
   CIAA, 2007, pp:11-23 [Conf]
   
4. Bruce W. Watson
   Automata Applications in Chip-Design Software. [Citation Graph (0, 0)][DBLP]
   CIAA, 2007, pp:24-26 [Conf]
   
5. Mikhail V. Volkov
   Synchronizing Automata Preserving a Chain of Partial Orders. [Citation Graph (0, 0)][DBLP]
   CIAA, 2007, pp:27-37 [Conf]
   
6. Jean-Marc Champarnaud, Franck Guingne, Jacques Farré
   Reducing Acyclic Cover Transducers. [Citation Graph (0, 0)][DBLP]
   CIAA, 2007, pp:38-50 [Conf]
   
7. Joachim Klein, Christel Baier
   On-the-Fly Stuttering in the Construction of Deterministic omega -Automata. [Citation Graph (0, 0)][DBLP]
   CIAA, 2007, pp:51-61 [Conf]
   
8. Massimiliano Goldwurm, Roberto Radicioni
   Average Value and Variance of Pattern Statistics in Rational Models. [Citation Graph (0, 0)][DBLP]
   CIAA, 2007, pp:62-72 [Conf]
   
9. Manfred Droste, George Rahonis
   Weighted Automata and Weighted Logics with Discounting. [Citation Graph (0, 0)][DBLP]
   CIAA, 2007, pp:73-84 [Conf]
   
10. Martin Kutrib, Andreas Malcher, Larissa Werlein
    Regulated Nondeterminism in Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:85-96 [Conf]
    
11. Kai Salomaa, Sheng Yu, Jinfeng Zan
    Deterministic Caterpillar Expressions. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:97-108 [Conf]
    
12. Johanna Högberg, Andreas Maletti, Jonathan May
    Backward and Forward Bisimulation Minimisation of Tree Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:109-121 [Conf]
    
13. Rafael C. Carrasco, Jan Daciuk, Mikel L. Forcada
    An Implementation of Deterministic Tree Automata Minimization. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:122-129 [Conf]
    
14. Shmuel Tomi Klein, Miri Ben-Nissan
    Accelerating Boyer Moore Searches on Binary Texts. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:130-143 [Conf]
    
15. Maxime Crochemore, Chiara Epifanio, Alessandra Gabriele, Filippo Mignosi
    On the Suffix Automaton with Mismatches. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:144-156 [Conf]
    
16. Hannu Peltola, Jorma Tarhio
    On String Matching in Chunked Texts. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:157-167 [Conf]
    
17. Mehryar Mohri, Pedro Moreno, Eugene Weinstein
    Factor Automata of Automata and Applications. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:168-179 [Conf]
    
18. Gregory Kucherov, Laurent Noé, Mikhail A. Roytberg
    Subset Seed Automaton. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:180-191 [Conf]
    
19. Frantisek Mráz, Martin Plátek, Friedrich Otto
    A Measure for the Degree of Nondeterminism of Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:192-202 [Conf]
    
20. Didier Caucal, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter
    Efficient Computation of Throughput Values of Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:203-213 [Conf]
    
21. Claus Brabrand, Robert Giegerich, Anders Møller
    Analyzing Ambiguity of Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:214-225 [Conf]
    
22. Margareta Ackerman, Jeffrey Shallit
    Efficient Enumeration of Regular Languages. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:226-242 [Conf]
    
23. François Barthélemy
    Multi-grain Relations. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:243-252 [Conf]
    
24. Michael Holtmann, Christof Löding
    Memory Reduction for Strategies in Infinite Games. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:253-264 [Conf]
    
25. Magnus Steinby, Catalin Ionut Tîrnauca
    Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:265-276 [Conf]
    
26. Natasa Jonoska, Joni Burnette Pirnot
    Finite State Automata Representing Two-Dimensional Subshifts. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:277-289 [Conf]
    
27. Marcella Anselmo, Dora Giammarresi, Maria Madonia
    Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:290-302 [Conf]
    
28. Frédérique Bassino, Julien David, Cyril Nicaud
    : A Library to Randomly and Exhaustively Generate Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:303-305 [Conf]
    
29. Olivier Blanc, Matthieu Constant, Patrick Watrin
    A Finite-State Super-Chunker. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:306-308 [Conf]
    
30. Costas S. Iliopoulos, M. Sohel Rahman, Michal Vorácek, Ladislav Vagner
    The Constrained Longest Common Subsequence Problem for Degenerate Strings. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:309-311 [Conf]
    
31. Barbara Klunder
    Finite Automata Accepting Star-Connected Languages. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:312-313 [Conf]
    
32. Clemens Marschner
    Efficiently Matching with Local Grammars Using Prefix Overlay Transducers. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:314-316 [Conf]
    
33. Jan Supol
    Significant Subpatterns Matching. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:317-319 [Conf]
    
34. Anssi Yli-Jyrä, Kimmo Koskenniemi
    A New Method for Compiling Parallel Replacement Rules. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:320-321 [Conf]