default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID22nd DCFS 2020: Vienna, Austria
- Galina Jirásková, Giovanni Pighizzini
:
Descriptional Complexity of Formal Systems - 22nd International Conference, DCFS 2020, Vienna, Austria, August 24-26, 2020, Proceedings. Lecture Notes in Computer Science 12442, Springer 2020, ISBN 978-3-030-62535-1 - Ravid Alon, Orna Kupferman:
Mutually Accepting Capacitated Automata. 1-12 - Marcella Anselmo, Dora Giammarresi, Maria Madonia, Carla Selmi:
Bad Pictures: Some Structural Properties Related to Overlaps. 13-25 - Ehud Cseresnyes, Hannes Seiwert:
Regular Expression Length via Arithmetic Formula Complexity. 26-38 - Manfred Droste, Zoltán Fülöp, Dávid Kószó, Heiko Vogler:
Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable. 39-51 - Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
On the Power of Generalized Forbidding Insertion-Deletion Systems. 52-63 - Stefan Hoffmann:
State Complexity Bounds for the Commutative Closure of Group Languages. 64-77 - Jozef Jirásek, Galina Jirásková:
Multiple Concatenation and State Complexity (Extended Abstract). 78-90 - Chris Keeler, Kai Salomaa:
Combining Limited Parallelism and Nondeterminism in Alternating Finite Automata. 91-103 - Stanislav Krymski, Alexander Okhotin:
Longer Shortest Strings in Two-Way Finite Automata. 104-116 - Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion. 117-129 - Pierre Marcus, Ilkka Törmä:
Descriptional Complexity of Winning Sets of Regular Languages. 130-141 - Alexander Okhotin, Elizaveta Sazhneva:
State Complexity of GF(2)-inverse and GF(2)-star on Binary Languages. 142-154 - Daniel Prusa:
Complexity of Two-Dimensional Rank-Reducing Grammars. 155-166 - Josef Rukavicka:
Palindromic Length of Words with Many Periodic Palindromes. 167-179 - Hannes Seiwert:
Operational Complexity of Straight Line Programs for Regular Languages. 180-192 - Victor L. Selivanov:
Classifying ømega-Regular Aperiodic k-Partitions. 193-205 - Taylor J. Smith, Kai Salomaa:
Recognition and Complexity Results for Projection Languages of Two-Dimensional Automata. 206-218 - Ludwig Staiger:
On the Generative Power of Quasiperiods. 219-230 - Martin Vu, Henning Fernau:
Insertion-Deletion with Substitutions II. 231-243
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:
