default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID20th DCFS 2018: Halifax, NS, Canada
- Stavros Konstantinidis, Giovanni Pighizzini:
Descriptional Complexity of Formal Systems - 20th IFIP WG 1.02 International Conference, DCFS 2018, Halifax, NS, Canada, July 25-27, 2018, Proceedings. Lecture Notes in Computer Science 10952, Springer 2018, ISBN 978-3-319-94630-6 - Ludwig Staiger:
Finite Automata and Randomness. 1-10 - Simon Beier, Markus Holzer
:
Properties of Right One-Way Jumping Finite Automata. 11-23 - Tara Brough:
Word Problem Languages for Free Inverse Monoids. 24-36 - Janusz A. Brzozowski, Sylvie Davies:
Most Complex Deterministic Union-Free Regular Languages. 37-48 - Da-Jung Cho, Yo-Sub Han, Kai Salomaa, Taylor J. Smith:
Site-Directed Insertion: Decision Problems, Maximality and Minimality. 49-61 - Louis-Marie Dando, Sylvain Lombardy:
Two-Way Automata over Locally Finite Semirings. 62-74 - Sylvie Davies:
A New Technique for Reachability of States in Concatenation Automata. 75-87 - Miguel Ferreira, Nelma Moreira, Rogério Reis:
Forward Injective Finite Automata: Exact and Random Generation of Nonisomorphic NFAs. 88-100 - Enrico Formenti, Paolo Massazza:
On the Generation of 2-Polyominoes. 101-113 - Massimiliano Goldwurm, Jianyi Lin, Marco Vignati:
A Local Limit Property for Pattern Statistics in Bicomponent Stochastic Models. 114-125 - Bruno Guillon, Luca Prigioniero:
Linear-Time Limited Automata. 126-138 - Stefan Hetzl, Simon Wolfsteiner:
Cover Complexity of Finite Languages. 139-150 - Markus Holzer, Simon Wolfsteiner:
On the Grammatical Complexity of Finite Languages. 151-162 - Oscar H. Ibarra, Ian McQuillan:
State Grammars with Stores. 163-174 - Rishat Ibrahimov, Kamil Khadiev, Krisjanis Prusis, Abuzer Yakaryilmaz:
Error-Free Affine, Unitary, and Probabilistic OBDDs. 175-187 - Galina Jirásková, Alexander Okhotin:
State Complexity of Unambiguous Operations on Deterministic Finite Automata. 188-199 - Chris Keeler, Kai Salomaa:
Cycle Height of Finite Automata. 200-211 - Martin Kutrib, Andreas Malcher, Christian Schneider:
Finite Automata with Undirected State Graphs. 212-223 - Alexander Okhotin, Kai Salomaa:
Further Closure Properties of Input-Driven Pushdown Automata. 224-236 - Tomoyuki Yamakami:
State Complexity Characterizations of Parameterized Degree-Bounded Graph Connectivity, Sub-Linear Space Computation, and the Linear Space Hypothesis. 237-249
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-01-31 22:54 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:
