default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID23rd DCFS 2021: Virtual Event
- Yo-Sub Han
, Sang-Ki Ko:
Descriptional Complexity of Formal Systems - 23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual Event, September 5, 2021, Proceedings. Lecture Notes in Computer Science 13037, Springer 2021, ISBN 978-3-030-93488-0 - Pavel Alaev, Victor L. Selivanov:
Complexity Issues for the Iterated h-Preorders. 1-12 - Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
On the Uniform Distribution of Regular Expressions. 13-25 - Viliam Geffert, Alexander Okhotin:
Deterministic One-Way Simulation of Two-Way Deterministic Finite Automata over Small Alphabets. 26-37 - Stefan Hoffmann:
Sync-Maximal Permutation Groups Equal Primitive Permutation Groups. 38-50 - Stefan Hoffmann:
Commutative Regular Languages with Product-Form Minimal Automata. 51-63 - Stefan Hoffmann:
State Complexity Investigations on Commutative Languages - the Upward and Downward Closure, Commutative Aperiodic and Commutative Group Languages. 64-75 - Markus Holzer, Christian Rauch:
More on the Descriptional Complexity of Products of Finite Automata. 76-87 - Chris Keeler, Kai Salomaa:
Width Measures of Alternating Finite Automata. 88-99 - Stavros Konstantinidis, António Machiavelo, Nelma Moreira, Rogério Reis:
Partial Derivative Automaton by Compressing Regular Expressions. 100-112 - Martin Kutrib, Matthias Wendlandt:
State Complexity of Partial Word Finite Automata. 113-124 - Olga Martynova, Alexander Okhotin:
State Complexity of Union and Intersection on Graph-Walking Automata. 125-136 - Jean Néraud:
Gray Cycles of Maximum Length Related to k-Character Substitutions. 137-149 - Alexander A. Rubtsov, Mikhail N. Vyalyi:
Automata Equipped with Auxiliary Data Structures and Regular Realizability Problems. 150-162 - Kevin Stier, Markus Ulbricht:
Disambiguation of Weighted Tree Automata. 163-175 - Stefan Kiefer, Cas Widdershoven:
Image-Binary Automata. 176-187 - Abuzer Yakaryilmaz:
Improved Constructions for Succinct Affine Automata. 188-199
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-20 23:46 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:
