default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID19th CIAA 2014: Giessen, Germany
- Markus Holzer, Martin Kutrib
:
Implementation and Application of Automata - 19th International Conference, CIAA 2014, Giessen, Germany, July 30 - August 2, 2014. Proceedings. Lecture Notes in Computer Science 8587, Springer 2014, ISBN 978-3-319-08845-7
Invited Papers
- Javier Esparza, Michael Luttenberger, Maximilian Schlund:
FPsolve: A Generic Solver for Fixpoint Equations over Semirings. 1-15 - Friedrich Otto:
Restarting Automata for Picture Languages: A Survey on Recent Developments. 16-41 - Giovanni Pighizzini:
Investigations on Automata and Languages over a Unary Alphabet. 42-57 - Georgios Ch. Sirakoulis:
Cellular Automata for Crowd Dynamics. 58-69
Regular Papers
- Ivone Amorim, António Machiavelo, Rogério Reis:
Counting Equivalent Linear Finite Transducers Using a Canonical Form. 70-83 - Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano:
On the Power of One-Way Automata with Quantum and Classical States. 84-97 - Franziska Biegler, Ian McQuillan:
On Comparing Deterministic Finite Automata and the Shuffle of Words. 98-109 - Francine Blanchet-Sadri, Kira Goldner, Aidan Shackleton:
Minimal Partial Languages and Automata. 110-123 - Janusz A. Brzozowski, Marek Szykula:
Large Aperiodic Semigroups. 124-135 - Kristína Cevorová, Galina Jirásková, Ivana Krajnáková:
On the Square of Regular Languages. 136-147 - Marzio De Biasi, Abuzer Yakaryilmaz:
Unary Languages Recognized by Two-Way One-Counter Automata. 148-161 - Akim Demaille, Alexandre Duret-Lutz, Sylvain Lombardy, Luca Saiu, Jacques Sakarovitch:
A Type System for Weighted Automata and Rational Expressions. 162-175 - Marius Dumitran, Javier Gil, Florin Manea, Victor Mitrana:
Bounded Prefix-Suffix Duplication. 176-187 - Akio Fujiyoshi:
Recognition of Labeled Multidigraphs by Spanning Tree Automata. 188-199 - Vladimir V. Gusev, Elena V. Pribavkina:
Reset Thresholds of Automata with Two Cycle Lengths. 200-210 - Oscar H. Ibarra:
On the Ambiguity, Finite-Valuedness, and Lossiness Problems in Acceptors and Transducers. 211-225 - Galina Jirásková, Matús Palmovský, Juraj Sebej:
Kleene Closure on Regular and Prefix-Free Languages. 226-237 - Sang-Ki Ko, Yo-Sub Han:
Left is Better than Right for Reducing Nondeterminism of NFAs. 238-251 - Petr Kurka, Tomás Vávra:
Analytic Functions Computable by Finite State Transducers. 252-263 - Eva Maia, Nelma Moreira, Rogério Reis:
Partial Derivative and Position Bisimilarity Automata. 264-277 - Andreas Maletti:
The Power of Regularity-Preserving Multi Bottom-up Tree Transducers. 278-289 - Johannes Osterholzer:
Pushdown Machines for Weighted Context-Free Tree Translation. 290-303 - Maria Pittou, George Rahonis:
Weighted Variable Automata over Infinite Alphabets. 304-317 - Jibran Rashid, Abuzer Yakaryilmaz:
Implications of Quantum Automata for Contextuality. 318-331 - Abiel Roche-Lima, Michael Domaratzki, Brian Fristensky:
Pairwise Rational Kernels Obtained by Automaton Operations. 332-345
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 2025-05-27 21:39 CEST 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:
