Login / Signup
DCFS
2001
2006
2016
2023
2001
2023
Keyphrases
Publications
2023
Giovanni Pighizzini
,
Luca Prigioniero
Pushdown and One-Counter Automata: Constant and Non-constant Memory Usage.
DCFS
(2023)
Michal Hospodár
,
Jozef Jirásek
,
Galina Jirásková
,
Juraj Sebej
Operational Complexity: NFA-to-DFA Trade-Off.
DCFS
(2023)
Josef Rukavicka
Construction of a Bi-infinite Power Free Word with a Given Factor and a Non-recurrent Letter.
DCFS
(2023)
Markus Holzer
,
Christian Rauch
On Jaffe's Pumping Lemma, Revisited.
DCFS
(2023)
Maximilian Kotowsky
,
Jan Philipp Wächter
The Word Problem for Finitary Automaton Groups.
DCFS
(2023)
Martin Kutrib
,
Andreas Malcher
,
Matthias Wendlandt
Complexity of Exclusive Nondeterministic Finite Automata.
DCFS
(2023)
Yo-Sub Han
,
Sungmin Kim
,
Sang-Ki Ko
,
Kai Salomaa
Existential and Universal Width of Alternating Finite Automata.
DCFS
(2023)
Neha Kuntewar
,
S. K. M. Anoop
,
Jayalal Sarma
Separating Words Problem over Groups.
DCFS
(2023)
Pascal Caron
,
Jean-Gabriel Luque
,
Bruno Patrou
Operational State Complexity Revisited: The Contribution of Monsters and Modifiers.
DCFS
(2023)
Marcella Anselmo
,
Giuseppa Castiglione
,
Manuela Flores
,
Dora Giammarresi
,
Maria Madonia
,
Sabrina Mantaci
Hypercubes and Isometric Words Based on Swap and Mismatch Distance.
DCFS
(2023)
Jean Weight
,
Trienko L. Grobler
,
Lynette van Zijl
,
Carlyle Stewart
A Tight Upper Bound on the Length of Maximal Bordered Box Repetition-Free Words.
DCFS
(2023)
Michael C. Chavrimootoo
Defying Gravity and Gadget Numerosity: The Complexity of the Hanano Puzzle.
DCFS
(2023)
Bianca Truthe
Merging Two Hierarchies of External Contextual Grammars with Subregular Selection.
DCFS
(2023)
Olga Martynova
,
Alexander Okhotin
Lower Bound.
DCFS
(2023)
volume 13918, 2023
Descriptional Complexity of Formal Systems - 25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4-6, 2023, Proceedings
DCFS
13918 (2023)
2022
Pamela Fleischmann
,
Lukas Haschke
,
Annika Huch
,
Annika Mayrock
,
Dirk Nowotka
Nearly k-Universal Words - Investigating a Part of Simon's Congruence.
DCFS
(2022)
Martin Kutrib
,
Matthias Wendlandt
State Complexity of Finite Partial Languages.
DCFS
(2022)
Sungmin Kim
,
Yo-Sub Han
,
Sang-Ki Ko
,
Kai Salomaa
On Simon's Congruence Closure of a String.
DCFS
(2022)
Stavros Konstantinidis
,
Mitja Mastnak
,
Nelma Moreira
,
Rogério Reis
Approximate NFA Universality Motivated by Information Theory.
DCFS
(2022)
Szilárd Zsolt Fazekas
,
Robert Mercas
Clusters of Repetition Roots Forming Prefix Chains.
DCFS
(2022)
Stefan Hoffmann
Reset Complexity and Completely Reachable Automata with Simple Idempotents.
DCFS
(2022)
Markus Holzer
,
Christian Rauch
On the Descriptional Complexity of the Direct Product of Finite Automata.
DCFS
(2022)
Orna Kupferman
,
Asaf Petruschka
Lazy Regular Sensing.
DCFS
(2022)
Hendrik Maarand
,
Hellis Tamm
Yet Another Canonical Nondeterministic Automaton.
DCFS
(2022)
Jérôme Durand-Lose
On the Power of Recursive Word-Functions Without Concatenation.
DCFS
(2022)
Benedek Nagy
Union-Complexities of Kleene Plus Operation.
DCFS
(2022)
Stefano Crespi-Reghizzi
The Alphabetic Complexity in Homomorphic Definitions of Word, Tree and Picture Languages.
DCFS
(2022)
Michal Hospodár
,
Peter Mlynárcik
,
Viktor Olejar
Operations on Subregular Languages and Nondeterministic State Complexity.
DCFS
(2022)
Duncan Adamson
Ranking Binary Unlabelled Necklaces in Polynomial Time.
DCFS
(2022)
Viliam Geffert
,
Dominika Palisínová
,
Alexander Szabari
State Complexity of Binary Coded Regular Languages.
DCFS
(2022)
volume 13439, 2022
Descriptional Complexity of Formal Systems - 24th IFIP WG 1.02 International Conference, DCFS 2022, Debrecen, Hungary, August 29-31, 2022, Proceedings
DCFS
13439 (2022)
2021
Chris Keeler
,
Kai Salomaa
Width Measures of Alternating Finite Automata.
DCFS
(2021)
Alexander A. Rubtsov
,
Mikhail N. Vyalyi
Automata Equipped with Auxiliary Data Structures and Regular Realizability Problems.
DCFS
(2021)
Stefan Hoffmann
Sync-Maximal Permutation Groups Equal Primitive Permutation Groups.
DCFS
(2021)
Sabine Broda
,
António Machiavelo
,
Nelma Moreira
,
Rogério Reis
On the Uniform Distribution of Regular Expressions.
DCFS
(2021)
Stavros Konstantinidis
,
António Machiavelo
,
Nelma Moreira
,
Rogério Reis
Partial Derivative Automaton by Compressing Regular Expressions.
DCFS
(2021)
Olga Martynova
,
Alexander Okhotin
State Complexity of Union and Intersection on Graph-Walking Automata.
DCFS
(2021)
Pavel Alaev
,
Victor L. Selivanov
Complexity Issues for the Iterated h-Preorders.
DCFS
(2021)
Martin Kutrib
,
Matthias Wendlandt
State Complexity of Partial Word Finite Automata.
DCFS
(2021)
Abuzer Yakaryilmaz
Improved Constructions for Succinct Affine Automata.
DCFS
(2021)
Kevin Stier
,
Markus Ulbricht
Disambiguation of Weighted Tree Automata.
DCFS
(2021)
Stefan Kiefer
,
Cas Widdershoven
Image-Binary Automata.
DCFS
(2021)
Jean Néraud
Gray Cycles of Maximum Length Related to k-Character Substitutions.
DCFS
(2021)
Viliam Geffert
,
Alexander Okhotin
Deterministic One-Way Simulation of Two-Way Deterministic Finite Automata over Small Alphabets.
DCFS
(2021)
Stefan Hoffmann
Commutative Regular Languages with Product-Form Minimal Automata.
DCFS
(2021)
Markus Holzer
,
Christian Rauch
More on the Descriptional Complexity of Products of Finite Automata.
DCFS
(2021)
Stefan Hoffmann
State Complexity Investigations on Commutative Languages - the Upward and Downward Closure, Commutative Aperiodic and Commutative Group Languages.
DCFS
(2021)
volume 13037, 2021
Descriptional Complexity of Formal Systems - 23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual Event, September 5, 2021, Proceedings
DCFS
13037 (2021)
2020
Pierre Marcus
,
Ilkka Törmä
Descriptional Complexity of Winning Sets of Regular Languages.
DCFS
(2020)
volume 12442, 2020
Descriptional Complexity of Formal Systems - 22nd International Conference, DCFS 2020, Vienna, Austria, August 24-26, 2020, Proceedings
DCFS
12442 (2020)