CIAA C

31 papers

YearTitle / Authors
20083-Way Composition of Weighted Finite-State Transducers.
Cyril Allauzen, Mehryar Mohri
2008A Run-Time Efficient Implementation of Compressed Pattern Matching Automata.
Tetsuya Matsumoto, Kazuhito Hagio, Masayuki Takeda
2008A Translation from the HTML DTD into a Regular Hedge Grammar.
Takuya Nishiyama, Yasuhiko Minamide
2008Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata.
Ahmed Bouajjani, Peter Habermehl, Lukás Holík, Tayssir Touili, Tomás Vojnar
2008Antimirov and Mosses's Rewrite System Revisited.
Marco Almeida, Nelma Moreira, Rogério Reis
2008Approximate Periods with Levenshtein Distance.
Martin Simunek, Borivoj Melichar
2008Automata, Probability, and Recursion.
Mihalis Yannakakis
2008Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning.
Ryan Dixon, Ömer Egecioglu, Timothy Sherwood
2008Automated Compositional Reasoning of Intuitionistically Closed Regular Properties.
Yih-Kuen Tsay, Bow-Yaw Wang
2008Combination of Context-Free Grammars and Tree Automata for Unranked and Ranked Trees.
Akio Fujiyoshi
2008Composed Bisimulation for Tree Automata.
Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík, Lisa Kaati, Tomás Vojnar
2008Computing Convex Hulls by Automata Iteration.
François Cantin, Axel Legay, Pierre Wolper
2008Concurrency, Synchronization, and Conflicts in Petri Nets.
Hsu-Chun Yen
2008Deterministic Pushdown Automata and Unary Languages.
Giovanni Pighizzini
2008Finite Eilenberg Machines.
Benoît Razet
2008Five Determinisation Algorithms.
Rob J. van Glabbeek, Bas Ploeger
2008Games for Temporal Logics on Trees.
Zoltán Ésik, Szabolcs Iván
2008Hopcroft's Minimization Technique: Queues or Stacks?.
Andrei Paun, Mihaela Paun, Alfonso Rodríguez-Patón
2008Hyper-Minimization in O(n2).
Andrew Badr
2008Implementation and Applications of Automata, 13th International Conference, CIAA 2008, San Francisco, California, USA, July 21-24, 2008. Proceedings
Oscar H. Ibarra, Bala Ravikumar
2008Language Decompositions, Primality, and Trajectory-Based Operations.
Kai Salomaa
2008Learning Regular Languages Using Nondeterministic Finite Automata.
Pedro García, Manuel Vazquez de Parga, Gloria Inés Alvarez, José Ruiz
2008Multi-Return Macro Tree Transducers.
Kazuhiro Inaba, Haruo Hosoya, Sebastian Maneth
2008Nondeterministic Finite Automata-Recent Results on the Descriptional and Computational Complexity.
Markus Holzer, Martin Kutrib
2008On Complexity of Two Dimensional Languages Generated by Transducers.
Egor Dolzhenko, Natasa Jonoska
2008Pattern Matching in DCA Coded Text.
Jan Lahoda, Borivoj Melichar, Jan Zdárek
2008Persistent Computations of Turing Machines.
Harald Hempel, Madlen Kimmritz
2008Progressive Solutions to FSM Equations.
Khaled El-Fakih, Nina Yevtushenko
2008Testing Whether a Binary and Prolongeable Regular Language LIs Geometrical or Not on the Minimal Deterministic Automaton of Pref(L).
Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne
2008The Number of Runs in Sturmian Words.
Pawel Baturo, Marcin Piatkowski, Wojciech Rytter
2008Tree-Series-to-Tree-Series Transformations.
Andreas Maletti