default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID23rd CIAA 2018: Charlottetown, PE, Canada
- Cezar Câmpeanu:
Implementation and Application of Automata - 23rd International Conference, CIAA 2018, Charlottetown, PE, Canada, July 30 - August 2, 2018, Proceedings. Lecture Notes in Computer Science 10977, Springer 2018, ISBN 978-3-319-94811-9 - Anne Condon:
On Design and Analysis of Chemical Reaction Network Algorithms. 1-3 - Stavros Konstantinidis, Nelma Moreira
, Rogério Reis, Joshua Young:
Regular Expressions and Transducers over Alphabet-Invariant and User-Defined Labels. 4-27 - Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Boosting Pushdown and Queue Machines by Preprocessing. 28-40 - Sylvain Lombardy, Jacques Sakarovitch:
The Validity of Weighted Automata. 41-45 - Cyril Allauzen, Michael D. Riley:
Algorithms for Weighted Finite Automata with Failure Transitions. 46-58 - Samira Attou, Ludovic Mignot, Djelloul Ziadi:
The Bottom-Up Position Tree Automaton and Its Compact Version. 59-70 - Laurent Bartholdi, Thibault Godin, Ines Klimann, Matthieu Picantin:
A New Hierarchy for Automaton Semigroups. 71-83 - Mikhail V. Berlinkov, Cyril Nicaud:
Synchronizing Random Almost-Group Automata. 84-96 - Johanna Björklund, Frank Drewes, Anna Jonsson:
A Comparison of Two N-Best Extraction Methods for Weighted Tree Automata. 97-108 - Janusz A. Brzozowski, Lila Kari, Bai Li, Marek Szykula:
State Complexity of Overlap Assembly. 109-120 - Marco Cognetta, Yo-Sub Han:
Online Stochastic Pattern Matching. 121-132 - Sylvie Davies:
State Complexity of Reversals of Deterministic Finite Automata with Output. 133-145 - Justin DeBenedetto, David Chiang:
Algorithms and Training for Weighted Multiset Automata and Regular Expressions. 146-158 - Antonio Di Stasio, Aniello Murano, Moshe Y. Vardi:
Solving Parity Games: Explicit vs Symbolic. 159-172 - Stefan Gerdjikov:
Generalised Twinning Property. 173-185 - Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero:
Non-self-embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata. 186-197 - Michal Hospodár, Markus Holzer:
The Ranges of Accepting State Complexities of Languages Resulting From Some Operations. 198-210 - Oscar H. Ibarra, Ian McQuillan:
Semilinearity of Families of Languages. 211-222 - Jozef Jirásek, Galina Jirásková:
The Exact Complexity of Star-Complement-Star. 223-235 - Martin Kutrib, Matthias Wendlandt:
Parametrizing String Assembling Systems. 236-247 - Sylvain Lombardy, Jacques Sakarovitch:
Two Routes to Automata Minimization and the Ways to Reach It Efficiently. 248-260 - Yusei Masuda, Shinnosuke Seki, Yuki Ubukata:
Towards the Algorithmic Molecular Self-assembly of Fractals by Cotranscriptional Folding. 261-273 - Birzhan Moldagaliyev, Ludwig Staiger, Frank Stephan:
On the Values for Factor Complexity. 274-285 - Yuki Nozaki, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara:
Enumeration of Cryptarithms Using Deterministic Finite Automata. 286-298 - Alexander Sakharov:
One-Counter Automata for Parsing and Language Approximation. 299-311 - Shubh Narayan Singh, Kanduru V. Krishna:
On Syntactic Complexity of Circular Semi-flower Automata. 312-323 - Corwin Sinnamon:
Complexity of Proper Suffix-Convex Regular Languages. 324-338
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 2026-08-22 01:32 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
