CIAA C

34 papers

YearTitle / Authors
2012A Disambiguation Algorithm for Finite Automata and Functional Transducers.
Mehryar Mohri
2012A Fast Suffix Automata Based Algorithm for Exact Online String Matching.
Simone Faro, Thierry Lecroq
2012A Formal Framework for Processes Inspired by the Functioning of Living Cells.
Andrzej Ehrenfeucht, Grzegorz Rozenberg
2012A Pushdown Transducer Extension for the OpenFst Library.
Cyril Allauzen, Michael Riley
2012Adding Pebbles to Weighted Automata.
Paul Gastin, Benjamin Monmege
2012Automata with Modulo Counters and Nondeterministic Counter Bounds.
Daniel Reidenbach, Markus L. Schmid
2012Automatic Theorem-Proving in Combinatorics on Words.
Daniel Goc, Dane Henshall, Jeffrey O. Shallit
2012Cellular Automata on Regular Rooted Trees.
Tullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi, Zoran Sunic
2012Crossing the Syntactic Barrier: Hom-Disequalities for H
Andreas Reuß, Helmut Seidl
2012Factor and Subsequence Kernels and Signatures of Rational Languages.
Ahmed Amarni, Sylvain Lombardy
2012How to Synchronize the Heads of a Multitape Automaton.
Oscar H. Ibarra, Nicholas Q. Trân
2012Hyper-minimization for Deterministic Tree Automata.
Artur Jez, Andreas Maletti
2012Implementation and Application of Automata - 17th International Conference, CIAA 2012, Porto, Portugal, July 17-20, 2012. Proceedings
Nelma Moreira, Rogério Reis
2012Implementing Computations in Automaton (Semi)groups.
Ines Klimann, Jean Mairesse, Matthieu Picantin
2012In Memoriam Sheng Yu.
Yuan Gao, Kai Salomaa
2012In Search of Most Complex Regular Languages.
Janusz A. Brzozowski
2012Multi-Tilde-Bar Derivatives.
Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot
2012Nominal Automata for Resource Usage Control.
Pierpaolo Degano, Gian-Luigi Ferrari, Gianluca Mezzetti
2012On Positive TAGED with a Bounded Number of Constraints.
Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko
2012On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata.
Martin Kutrib, Friedrich Otto
2012On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs.
Galina Jirásková, Tomás Masopust
2012P(l)aying for Synchronization.
Fedor M. Fominykh, Mikhail V. Volkov
2012Regular Ideal Languages and Their Boolean Combinations.
Franz Jahn, Manfred Kufleitner, Alexander Lauser
2012Restarting Tiling Automata.
Daniel Prusa, Frantisek Mráz
2012SDFA: Series DFA for Memory-Efficient Regular Expression Matching.
Tingwen Liu, Yong Sun, Li Guo, Binxing Fang
2012Strict Local Testability with Consensus Equals Regularity.
Stefano Crespi-Reghizzi, Pierluigi San Pietro
2012Synchronization of Automata with One Undefined or Ambiguous Transition.
Pavel V. Martyugin
2012Synchronizing Automata of Bounded Rank.
Vladimir V. Gusev
2012Synchronizing Automata on Quasi-Eulerian Digraph.
Mikhail V. Berlinkov
2012The Removal of Weighted ε-Transitions.
Sylvain Lombardy, Jacques Sakarovitch
2012Typed Linear Algebra for Weigthed (Probabilistic) Automata.
José Nuno Oliveira
2012Weak Inclusion for Recursive XML Types.
Joshua Amavi, Jacques Chabin, Pierre Réty
2012Weighted LTL with Discounting.
Eleni Mandrali
2012Weighted Nested Word Automata and Logics over Strong Bimonoids.
Manfred Droste, Bundit Pibaljommee