default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID17th CIAA 2012: Porto, Portugal
- Nelma Moreira
, Rogério Reis:
Implementation and Application of Automata - 17th International Conference, CIAA 2012, Porto, Portugal, July 17-20, 2012. Proceedings. Lecture Notes in Computer Science 7381, Springer 2012, ISBN 978-3-642-31605-0
Invited Talks
- Yuan Gao, Kai Salomaa:
In Memoriam Sheng Yu. 1-4 - Janusz A. Brzozowski:
In Search of Most Complex Regular Languages. 5-24 - Andrzej Ehrenfeucht, Grzegorz Rozenberg:
A Formal Framework for Processes Inspired by the Functioning of Living Cells. 25-27 - Paul Gastin, Benjamin Monmege:
Adding Pebbles to Weighted Automata. 28-51 - José Nuno Oliveira:
Typed Linear Algebra for Weigthed (Probabilistic) Automata. 52-65
Regular Papers
- Cyril Allauzen, Michael Riley:
A Pushdown Transducer Extension for the OpenFst Library. 66-77 - Joshua Amavi, Jacques Chabin, Pierre Réty:
Weak Inclusion for Recursive XML Types. 78-89 - Mikhail V. Berlinkov:
Synchronizing Automata on Quasi-Eulerian Digraph. 90-100 - Tullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi, Zoran Sunic:
Cellular Automata on Regular Rooted Trees. 101-112 - Stefano Crespi-Reghizzi, Pierluigi San Pietro:
Strict Local Testability with Consensus Equals Regularity. 113-124 - Pierpaolo Degano, Gian-Luigi Ferrari, Gianluca Mezzetti:
Nominal Automata for Resource Usage Control. 125-137 - Manfred Droste, Bundit Pibaljommee:
Weighted Nested Word Automata and Logics over Strong Bimonoids. 138-148 - Simone Faro, Thierry Lecroq:
A Fast Suffix Automata Based Algorithm for Exact Online String Matching. 149-158 - Fedor M. Fominykh, Mikhail V. Volkov:
P(l)aying for Synchronization. 159-170 - Vladimir V. Gusev:
Synchronizing Automata of Bounded Rank. 171-179 - Daniel Goc, Dane Henshall, Jeffrey O. Shallit:
Automatic Theorem-Proving in Combinatorics on Words. 180-191 - Oscar H. Ibarra, Nicholas Q. Trân:
How to Synchronize the Heads of a Multitape Automaton. 192-204 - Franz Jahn, Manfred Kufleitner, Alexander Lauser:
Regular Ideal Languages and Their Boolean Combinations. 205-216 - Artur Jez, Andreas Maletti:
Hyper-minimization for Deterministic Tree Automata. 217-228 - Galina Jirásková, Tomás Masopust:
On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs. 229-239 - Ines Klimann, Jean Mairesse, Matthieu Picantin:
Implementing Computations in Automaton (Semi)groups. 240-252 - Martin Kutrib, Friedrich Otto:
On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata. 253-264 - Mehryar Mohri:
A Disambiguation Algorithm for Finite Automata and Functional Transducers. 265-277 - Pavel V. Martyugin:
Synchronization of Automata with One Undefined or Ambiguous Transition. 278-288 - Daniel Prusa, Frantisek Mráz:
Restarting Tiling Automata. 289-300 - Andreas Reuß, Helmut Seidl:
Crossing the Syntactic Barrier: Hom-Disequalities for H1-Clauses. 301-312
Short Papers
- Ahmed Amarni, Sylvain Lombardy:
Factor and Subsequence Kernels and Signatures of Rational Languages. 313-320 - Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot:
Multi-Tilde-Bar Derivatives. 321-328 - Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko:
On Positive TAGED with a Bounded Number of Constraints. 329-336 - Tingwen Liu, Yong Sun, Li Guo, Binxing Fang:
SDFA: Series DFA for Memory-Efficient Regular Expression Matching. 337-344 - Sylvain Lombardy, Jacques Sakarovitch:
The Removal of Weighted ε-Transitions. 345-352 - Eleni Mandrali:
Weighted LTL with Discounting. 353-360 - Daniel Reidenbach, Markus L. Schmid:
Automata with Modulo Counters and Nondeterministic Counter Bounds. 361-368
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-15 19:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
