CIAA 2004: List of Accepted papers.
Cyril Allauzen, Mehryar Mohri and Brian Roark, “A General Weighted Grammar Library”
Aneta Binder, Rudolf Freund, Georg Lojka and Marion Oswald, “Implementation of Catalytic P Systems”
Björn Borchardt, “Code Selection by Tree Series Transducers”
Henning Bordihn, Markus Holzer and Martin Kutrib, “Some Non-Semi-Decidability Problems for Linear and Deterministic Context-Free Languages”
Olivier Carton and Jean Berstel, “On the complexity of Hopcroft's state minimization algorithm”
Jean-Marc Champarnaud, Fabien Coulon and Thomas Paranthoen, “Brute force determinization of NFAs by means of state covers”
Jean-Marc Champarnaud, Florent Nicart and Djelloul Ziadi, “Computing the Follow Automaton of an Expression”
Mark Daley and Ian McQuillan, “Viral gene compression: complexity and verification”
Wojciech Fraczak and Wojciech Debski, “Concatenation State Machines and Simple Functions”
Michiel Frishert, Bruce Watson and Loek Cleophas, “FIRE Station: An environment for manipulating finite automata and regular expression views”
Alfons Geser, Dieter Hofbauer, Johannes Waldmann and Hans Zantema, “Finding finite automata that certify termination of string rewriting”
Mathieu Giraud and Dominique Lavenier, “Linear Encoding Scheme for Weighted Finite Automata”
Yonghua Han, Bin Ma and Kaizhong Zhang, “An Automata Approach to Match Gapped Sequence Tags”
Galina Jiraskova and Alexander Szabari, “State Complexity of the Concatenation and Complementation of Regular Languages”
Sebastian John, “Minimal unambiguous eNFA”
Lila Kari, Stavros Konstantinidis and Petr Sosik, “Substitutions, Trajectories and Noisy Channels”
Bryan Krawetz, John Lawrence and Jeffrey Shallit, “State Complexity and the Monoid of Transformations of a Finite Set”
Harumichi Nishimura and Tomoyuki Yamakami, “An Application of Quantum Finite Automata to Interactive Proof Systems”
Fing Fung Ting and Zeshan Peng, “Time and Space Efficient Algorithms for Constrained Sequence Alignment”
German Tischler, “Parametric weighted finite automata for figure drawing”
Manuel Vilares Ferro, Juan Otero and Jorge Grana, “Regional Finite-State Error Repair”
Baozhen Shan, “Stochastic Context-Free Graph Grammars for Glycoprotein Modelling”
Derick Wood and Yo-Sub Han, “The generalization of generalized automata: Expression automata”
Anssi Yli-Jyrä, “Approximating Dependency Grammars through Intersection of Regular Languages ”
Vladimir Zakharov and Ivan Zakharyaschev, “On the equivalence-checking problem for a model of programs related with multi-tape automata”
Accepted Posters:
Liliana Cojocaru, “Simulating the Process of Gene Assembly in Ciliates”
Jean-Michel Couvreur, “A BDD-like Implementation of an Automata Package”
Manuel Delgado and Jose Morais, “Approximation to the smallest regular expression for a given regular language”
Attila Egri-Nagy and Chrystopher L. Nehaniv, “Algebraic Hierarchical Decomposition of Finite State Automata: Comparison of Implementations for Krohn-Rhodes Theory”
Mark Eramian and Matthew Drotar, “Does Hausdorff Dimension measure Texture Complexity?”
Michiel Frishert and Bruce Watson, “Combining regular expressions with (near-)optimal Brzozowski automata”
Denis Lugiez, “From Automata to semilinear sets: a solution for polyhedra and even more general sets”
Andreas Maletti, “Myhill-Nerode Theorem for Sequential Transducers over Unique GCD-Monoids”
Andrei Paun and Cezar Campeanu, “NFA to DFCA Transformations For Binary Alphabets”
Libor Polak, “Minimalizations of NFA Using Universal Automaton”
Tomas Polcar and Borivoj Melichar, “Two-dimensional Pattern Matching by Two-dimensional Online Tessellation Automata”
Hellis Tamm, Matti Nykanen and Esko Ukkonen, “Size Reduction of Multitape Automata”
Gaoyan Xie, Cheng Li and Zhe Dang, “Testability of Oracle Automata”
Lynette van Zijl, “Magic Numbers for Symmetric Difference NFAs”
11 May, 2004