default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID21st DCFS 2019: Košice, Slovakia
- Michal Hospodár, Galina Jirásková, Stavros Konstantinidis:
Descriptional Complexity of Formal Systems - 21st IFIP WG 1.02 International Conference, DCFS 2019, Košice, Slovakia, July 17-19, 2019, Proceedings. Lecture Notes in Computer Science 11612, Springer 2019, ISBN 978-3-030-23246-7 - Rudolf Freund:
A General Framework for Sequential Grammars with Control Mechanisms. 1-34 - Jarkko Kari:
Low-Complexity Tilings of the Plane. 35-45 - Benedek Nagy:
Union-Freeness, Deterministic Union-Freeness and Union-Complexity. 46-56 - Giovanni Pighizzini:
Limited Automata: Properties, Complexity and Variants. 57-73 - Simon Beier, Markus Holzer
:
Nondeterministic Right One-Way Jumping Finite Automata (Extended Abstract). 74-85 - Janusz A. Brzozowski, Sylvie Davies, Abhishek Madan:
State Complexity of Single-Word Pattern Matching in Regular Languages. 86-97 - Sylvie Davies, Michal Hospodár:
Square, Power, Positive Closure, and Complementation on Star-Free Languages. 98-110 - Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Descriptional Complexity of Matrix Simple Semi-conditional Grammars. 111-123 - Henning Fernau, Martin Vu:
Regulated Tree Automata. 124-136 - Daniel Gabric, Stepan Holub, Jeffrey O. Shallit:
Generalized de Bruijn Words and the State Complexity of Conjugate Sets. 137-146 - Kitti Gelle, Szabolcs Iván:
The Syntactic Complexity of Semi-flower Languages. 147-157 - Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
Limited Nondeterminism of Input-Driven Pushdown Automata: Decidability and Complexity. 158-170 - Mathieu Hoyrup, Cristobal Rojas, Victor L. Selivanov, Donald M. Stull:
Computability on Quasi-Polish Spaces. 171-183 - Galina Jirásková, Ivana Krajnáková:
NFA-to-DFA Trade-Off for Regular Operations. 184-196 - Lila Kari, Timothy Ng:
State Complexity of Simple Splicing. 197-209 - Chris Keeler, Kai Salomaa:
Nondeterminism Growth and State Complexity. 210-222 - Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Descriptional Complexity of Iterated Uniform Finite-State Transducers. 223-234 - Mizuhito Ogawa, Victor L. Selivanov:
On Classes of Regular Languages Related to Monotone WQOs. 235-247 - Alexander Okhotin, Elizaveta Sazhneva:
State Complexity of GF(2)-Concatenation and GF(2)-Inverse on Unary Languages. 248-259 - Giovanni Pighizzini, Luca Prigioniero:
Pushdown Automata and Constant Height: Decidability and Bounds. 260-271 - Petra Wolf:
On the Decidability of Finding a Positive ILP-Instance in a Regular Set of ILP-Instances. 272-284 - Tomoyuki Yamakami:
How Does Adiabatic Quantum Computation Fit into Quantum Automata Theory? 285-297
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-12-04 22:06 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:
