| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Marcella Anselmo, Giuseppa Castiglione, Manuela Flores, Dora Giammarresi, Maria Madonia, Sabrina Mantaci |
Hypercubes and Isometric Words Based on Swap and Mismatch Distance.  |
DCFS  |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Pascal Caron, Jean-Gabriel Luque, Bruno Patrou |
Operational State Complexity Revisited: The Contribution of Monsters and Modifiers. |
DCFS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Olga Martynova 0001, Alexander Okhotin |
Shortest Accepted Strings for Two-Way Finite Automata: Approaching the 2n Lower Bound. |
DCFS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Yo-Sub Han, Sungmin Kim, Sang-Ki Ko, Kai Salomaa |
Existential and Universal Width of Alternating Finite Automata. |
DCFS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Giovanni Pighizzini, Luca Prigioniero |
Pushdown and One-Counter Automata: Constant and Non-constant Memory Usage. |
DCFS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Neha Kuntewar, S. K. M. Anoop, Jayalal Sarma |
Separating Words Problem over Groups. |
DCFS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Andreas Malcher, Matthias Wendlandt |
Complexity of Exclusive Nondeterministic Finite Automata. |
DCFS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bordihn, Nicholas Q. Tran, György Vaszil (eds.) |
Descriptional Complexity of Formal Systems - 25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4-6, 2023, Proceedings |
DCFS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael C. Chavrimootoo |
Defying Gravity and Gadget Numerosity: The Complexity of the Hanano Puzzle. |
DCFS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Maximilian Kotowsky, Jan Philipp Wächter |
The Word Problem for Finitary Automaton Groups. |
DCFS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Hospodár, Jozef Jirásek 0001, Galina Jirásková, Juraj Sebej |
Operational Complexity: NFA-to-DFA Trade-Off. |
DCFS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Bianca Truthe |
Merging Two Hierarchies of External Contextual Grammars with Subregular Selection. |
DCFS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Josef Rukavicka |
Construction of a Bi-infinite Power Free Word with a Given Factor and a Non-recurrent Letter. |
DCFS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Holzer 0001, Christian Rauch 0001 |
On Jaffe's Pumping Lemma, Revisited. |
DCFS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Orna Kupferman, Asaf Petruschka |
Lazy Regular Sensing. |
DCFS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Hendrik Maarand, Hellis Tamm |
Yet Another Canonical Nondeterministic Automaton. |
DCFS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Holzer 0001, Christian Rauch 0001 |
On the Descriptional Complexity of the Direct Product of Finite Automata. |
DCFS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Matthias Wendlandt |
State Complexity of Finite Partial Languages. |
DCFS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Stavros Konstantinidis, Mitja Mastnak, Nelma Moreira, Rogério Reis |
Approximate NFA Universality Motivated by Information Theory. |
DCFS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Szilárd Zsolt Fazekas, Robert Mercas |
Clusters of Repetition Roots Forming Prefix Chains. |
DCFS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Pamela Fleischmann, Lukas Haschke, Annika Huch, Annika Mayrock, Dirk Nowotka |
Nearly k-Universal Words - Investigating a Part of Simon's Congruence. |
DCFS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Sungmin Kim, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa |
On Simon's Congruence Closure of a String. |
DCFS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Hoffmann 0001 |
Reset Complexity and Completely Reachable Automata with Simple Idempotents. |
DCFS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Hospodár, Peter Mlynárcik, Viktor Olejár |
Operations on Subregular Languages and Nondeterministic State Complexity. |
DCFS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert, Dominika Palisínová, Alexander Szabari |
State Complexity of Binary Coded Regular Languages. |
DCFS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Duncan Adamson |
Ranking Binary Unlabelled Necklaces in Polynomial Time. |
DCFS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Yo-Sub Han, György Vaszil (eds.) |
Descriptional Complexity of Formal Systems - 24th IFIP WG 1.02 International Conference, DCFS 2022, Debrecen, Hungary, August 29-31, 2022, Proceedings |
DCFS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefano Crespi-Reghizzi |
The Alphabetic Complexity in Homomorphic Definitions of Word, Tree and Picture Languages. |
DCFS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Benedek Nagy |
Union-Complexities of Kleene Plus Operation. |
DCFS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérôme Durand-Lose |
On the Power of Recursive Word-Functions Without Concatenation. |
DCFS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Kevin Stier, Markus Ulbricht 0001 |
Disambiguation of Weighted Tree Automata. |
DCFS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert, Alexander Okhotin |
Deterministic One-Way Simulation of Two-Way Deterministic Finite Automata over Small Alphabets. |
DCFS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Néraud |
Gray Cycles of Maximum Length Related to k-Character Substitutions. |
DCFS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Hoffmann 0001 |
Commutative Regular Languages with Product-Form Minimal Automata. |
DCFS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Kiefer, Cas Widdershoven |
Image-Binary Automata. |
DCFS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Matthias Wendlandt |
State Complexity of Partial Word Finite Automata. |
DCFS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Olga Martynova 0001, Alexander Okhotin |
State Complexity of Union and Intersection on Graph-Walking Automata. |
DCFS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel Alaev, Victor L. Selivanov |
Complexity Issues for the Iterated h-Preorders. |
DCFS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Stavros Konstantinidis, António Machiavelo, Nelma Moreira, Rogério Reis |
Partial Derivative Automaton by Compressing Regular Expressions. |
DCFS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Abuzer Yakaryilmaz |
Improved Constructions for Succinct Affine Automata. |
DCFS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Hoffmann 0001 |
Sync-Maximal Permutation Groups Equal Primitive Permutation Groups. |
DCFS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander A. Rubtsov, Mikhail N. Vyalyi |
Automata Equipped with Auxiliary Data Structures and Regular Realizability Problems. |
DCFS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris Keeler, Kai Salomaa |
Width Measures of Alternating Finite Automata. |
DCFS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Hoffmann 0001 |
State Complexity Investigations on Commutative Languages - the Upward and Downward Closure, Commutative Aperiodic and Commutative Group Languages. |
DCFS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Holzer 0001, Christian Rauch 0001 |
More on the Descriptional Complexity of Products of Finite Automata. |
DCFS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Yo-Sub Han, Sang-Ki Ko (eds.) |
Descriptional Complexity of Formal Systems - 23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual Event, September 5, 2021, Proceedings |
DCFS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis |
On the Uniform Distribution of Regular Expressions. |
DCFS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Ehud Cseresnyes, Hannes Seiwert |
Regular Expression Length via Arithmetic Formula Complexity. |
DCFS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Hannes Seiwert |
Operational Complexity of Straight Line Programs for Regular Languages. |
DCFS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor L. Selivanov |
Classifying ømega-Regular Aperiodic k-Partitions. |
DCFS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Prusa |
Complexity of Two-Dimensional Rank-Reducing Grammars. |
DCFS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Manfred Droste, Zoltán Fülöp 0001, Dávid Kószó, Heiko Vogler |
Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable. |
DCFS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Vu, Henning Fernau |
Insertion-Deletion with Substitutions II. |
DCFS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Galina Jirásková, Giovanni Pighizzini (eds.) |
Descriptional Complexity of Formal Systems - 22nd International Conference, DCFS 2020, Vienna, Austria, August 24-26, 2020, Proceedings |
DCFS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Ludwig Staiger |
On the Generative Power of Quasiperiods. |
DCFS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Marcus, Ilkka Törmä |
Descriptional Complexity of Winning Sets of Regular Languages. |
DCFS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcella Anselmo, Dora Giammarresi, Maria Madonia, Carla Selmi |
Bad Pictures: Some Structural Properties Related to Overlaps. |
DCFS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Stanislav Krymski, Alexander Okhotin |
Longer Shortest Strings in Two-Way Finite Automata. |
DCFS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Josef Rukavicka |
Palindromic Length of Words with Many Periodic Palindromes. |
DCFS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Jozef Jirásek 0001, Galina Jirásková |
Multiple Concatenation and State Complexity (Extended Abstract). |
DCFS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman |
On the Power of Generalized Forbidding Insertion-Deletion Systems. |
DCFS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Hoffmann 0001 |
State Complexity Bounds for the Commutative Closure of Group Languages. |
DCFS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Taylor J. Smith, Kai Salomaa |
Recognition and Complexity Results for Projection Languages of Two-Dimensional Automata. |
DCFS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano |
Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion. |
DCFS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Ravid Alon, Orna Kupferman |
Mutually Accepting Capacitated Automata. |
DCFS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin, Elizaveta Sazhneva |
State Complexity of GF(2)-inverse and GF(2)-star on Binary Languages. |
DCFS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris Keeler, Kai Salomaa |
Combining Limited Parallelism and Nondeterminism in Alternating Finite Automata. |
DCFS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Petra Wolf 0002 |
On the Decidability of Finding a Positive ILP-Instance in a Regular Set of ILP-Instances. |
DCFS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Freund |
A General Framework for Sequential Grammars with Control Mechanisms. |
DCFS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Jarkko Kari |
Low-Complexity Tilings of the Plane. |
DCFS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Gabric, Stepan Holub, Jeffrey O. Shallit |
Generalized de Bruijn Words and the State Complexity of Conjugate Sets. |
DCFS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Simon Beier, Markus Holzer 0001 |
Nondeterministic Right One-Way Jumping Finite Automata (Extended Abstract). |
DCFS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Hospodár, Galina Jirásková, Stavros Konstantinidis (eds.) |
Descriptional Complexity of Formal Systems - 21st IFIP WG 1.02 International Conference, DCFS 2019, Košice, Slovakia, July 17-19, 2019, Proceedings |
DCFS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Sylvie Davies, Michal Hospodár |
Square, Power, Positive Closure, and Complementation on Star-Free Languages. |
DCFS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Mathieu Hoyrup, Cristobal Rojas, Victor L. Selivanov, Donald M. Stull |
Computability on Quasi-Polish Spaces. |
DCFS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman |
Descriptional Complexity of Matrix Simple Semi-conditional Grammars. |
DCFS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Giovanni Pighizzini |
Limited Automata: Properties, Complexity and Variants. |
DCFS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Galina Jirásková, Ivana Krajnáková |
NFA-to-DFA Trade-Off for Regular Operations. |
DCFS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin, Elizaveta Sazhneva |
State Complexity of GF(2)-Concatenation and GF(2)-Inverse on Unary Languages. |
DCFS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Fernau, Martin Vu |
Regulated Tree Automata. |
DCFS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomoyuki Yamakami |
How Does Adiabatic Quantum Computation Fit into Quantum Automata Theory? |
DCFS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Mizuhito Ogawa, Victor L. Selivanov |
On Classes of Regular Languages Related to Monotone WQOs. |
DCFS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris Keeler, Kai Salomaa |
Nondeterminism Growth and State Complexity. |
DCFS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Kitti Gelle, Szabolcs Iván |
The Syntactic Complexity of Semi-flower Languages. |
DCFS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Benedek Nagy |
Union-Freeness, Deterministic Union-Freeness and Union-Complexity. |
DCFS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano |
Descriptional Complexity of Iterated Uniform Finite-State Transducers. |
DCFS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Janusz A. Brzozowski, Sylvie Davies, Abhishek Madan |
State Complexity of Single-Word Pattern Matching in Regular Languages. |
DCFS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Giovanni Pighizzini, Luca Prigioniero |
Pushdown Automata and Constant Height: Decidability and Bounds. |
DCFS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Lila Kari, Timothy Ng 0001 |
State Complexity of Simple Splicing. |
DCFS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Yo-Sub Han, Sang-Ki Ko, Kai Salomaa |
Limited Nondeterminism of Input-Driven Pushdown Automata: Decidability and Complexity. |
DCFS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Hetzl, Simon Wolfsteiner |
Cover Complexity of Finite Languages. |
DCFS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Tara Brough |
Word Problem Languages for Free Inverse Monoids. |
DCFS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Galina Jirásková, Alexander Okhotin |
State Complexity of Unambiguous Operations on Deterministic Finite Automata. |
DCFS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Louis-Marie Dando, Sylvain Lombardy |
Two-Way Automata over Locally Finite Semirings. |
DCFS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Ludwig Staiger |
Finite Automata and Randomness. |
DCFS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Massimiliano Goldwurm, Jianyi Lin, Marco Vignati |
A Local Limit Property for Pattern Statistics in Bicomponent Stochastic Models. |
DCFS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin, Kai Salomaa |
Further Closure Properties of Input-Driven Pushdown Automata. |
DCFS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Simon Beier, Markus Holzer 0001 |
Properties of Right One-Way Jumping Finite Automata. |
DCFS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Andreas Malcher, Christian Schneider |
Finite Automata with Undirected State Graphs. |
DCFS |
2018 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license