The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Oscar H. Ibarra
    Automata-Theoretic Techniques for Analyzing Infinite-State Systems. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:1- [Conf]
  2. Jonathan Lee, Jeffrey Shallit
    Enumerating Regular Expressions and Their Languages. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:2-22 [Conf]
  3. Cyril Allauzen, Mehryar Mohri, Brian Roark
    A General Weighted Grammar Library. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:23-34 [Conf]
  4. Jean Berstel, Olivier Carton
    On the Complexity of Hopcroft's State Minimization Algorithm. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:35-44 [Conf]
  5. Aneta Binder, Rudolf Freund, Georg Lojka, Marion Oswald
    Implementation of Catalytic P Systems. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:45-56 [Conf]
  6. Björn Borchardt
    Code Selection by Tree Series Transducers. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:57-67 [Conf]
  7. Henning Bordihn, Markus Holzer, Martin Kutrib
    Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:68-79 [Conf]
  8. Jean-Marc Champarnaud, Fabien Coulon, Thomas Paranthoën
    Brute Force Determinization of NFAs by Means of State Covers. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:80-89 [Conf]
  9. Jean-Marc Champarnaud, Florent Nicart, Djelloul Ziadi
    Computing the Follow Automaton of an Expression. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:90-101 [Conf]
  10. Mark Daley, Ian McQuillan
    Viral Gene Compression: Complexity and Verification. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:102-112 [Conf]
  11. Wojciech Debski, Wojciech Fraczak
    Concatenation State Machines and Simple Functions. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:113-124 [Conf]
  12. Michiel Frishert, Loek G. Cleophas, Bruce W. Watson
    FIRE Station: An Environment for Manipulating Finite Automata and Regular Expression Views. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:125-133 [Conf]
  13. Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema
    Finding Finite Automata That Certify Termination of String Rewriting. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:134-145 [Conf]
  14. Mathieu Giraud, Dominique Lavenier
    Linear Encoding Scheme for Weighted Finite Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:146-155 [Conf]
  15. Yo-Sub Han, Derick Wood
    The Generalization of Generalized Automata: Expression Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:156-166 [Conf]
  16. Yonghua Han, Bin Ma, Kaizhong Zhang
    An Automata Approach to Match Gapped Sequence Tags Against Protein Database. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:167-177 [Conf]
  17. Jozef Jirásek, Galina Jirásková, Alexander Szabari
    State Complexity of Concatenation and Complementation of Regular Languages. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:178-189 [Conf]
  18. Sebastian John
    Minimal Unambiguous eNFA. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:190-201 [Conf]
  19. Lila Kari, Stavros Konstantinidis, Petr Sosík
    Substitutions, Trajectories and Noisy Channels. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:202-212 [Conf]
  20. Bryan Krawetz, John Lawrence, Jeffrey Shallit
    State Complexity and the Monoid of Transformations of a Finite Set. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:213-224 [Conf]
  21. Harumichi Nishimura, Tomoyuki Yamakami
    An Application of Quantum Finite Automata to Interactive Proof Systems. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:225-236 [Conf]
  22. Z. S. Peng, H. F. Ting
    Time and Space Efficient Algorithms for Constrained Sequence Alignment. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:237-246 [Conf]
  23. Baozhen Shan
    Stochastic Context-Free Graph Grammars for Glycoprotein Modelling. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:247-258 [Conf]
  24. German Tischler
    Parametric Weighted Finite Automata for Figure Drawing. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:259-268 [Conf]
  25. Manuel Vilares Ferro, Juan Otero, Jorge Graña Gil
    Regional Finite-State Error Repair. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:269-280 [Conf]
  26. Anssi Yli-Jyrä
    Approximating Dependency Grammars Through Intersection of Regular Languages. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:281-292 [Conf]
  27. Vladimir A. Zakharov, Ivan Zakharyaschev
    On the Equivalence-Checking Problem for a Model of Programs Related with Multi-tape Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:293-305 [Conf]
  28. Cezar Câmpeanu, Andrei Paun
    Tight Bounds for NFA to DFCA Transformations for Binary Alphabets. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:306-307 [Conf]
  29. Liliana Cojocaru
    Simulating the Process of Gene Assembly in Ciliates. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:308-309 [Conf]
  30. Jean-Michel Couvreur
    A BDD-Like Implementation of an Automata Package. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:310-311 [Conf]
  31. Manuel Delgado, José Morais
    Approximation to the Smallest Regular Expression for a Given Regular Language. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:312-314 [Conf]
  32. Attila Egri-Nagy, Chrystopher L. Nehaniv
    Algebraic Hierarchical Decomposition of Finite State Automata: Comparison of Implementations for Krohn-Rhodes Theory. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:315-316 [Conf]
  33. Mark G. Eramian, Matthew Drotar
    Does Hausdorff Dimension Measure Texture Complexity?. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:317-318 [Conf]
  34. Michiel Frishert, Bruce W. Watson
    Combining Regular Expressions with (Near-)Optimal Brzozowski Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:319-320 [Conf]
  35. Denis Lugiez
    From Automata to Semilinear Sets: A Logical Solution for Sets L(C, P). [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:321-322 [Conf]
  36. Andreas Maletti
    Myhill-Nerode Theorem for Sequential Transducers over Unique GCD-Monoids. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:323-324 [Conf]
  37. Libor Polák
    Minimalizations of NFA Using the Universal Automaton. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:325-326 [Conf]
  38. Tomás Polcar, Borivoj Melichar
    Two-Dimensional Pattern Matching by Two-Dimensional Online Tessellation Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:327-328 [Conf]
  39. Hellis Tamm, Matti Nykänen, Esko Ukkonen
    Size Reduction of Multitape Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:329-330 [Conf]
  40. Gaoyan Xie, Cheng Li, Zhe Dang
    Testability of Oracle Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:331-332 [Conf]
  41. Lynette van Zijl
    Magic Numbers for Symmetric Difference NFAs. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:333-334 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002