| Morphic Sequences Versus Automatic Sequences
|
2021 |
Allouche, Jean-Paul |
| Parsimonious Computational Completeness
|
2021 |
Fernau, Henning |
| Extremal Binary PFAs in a Černý Family
|
2021 |
Cambie, Stijn |
| Variations on the Post Correspondence Problem for Free Groups
|
2021 |
Ciobanu, Laura |
| Balanced-By-Construction Regular and w-Regular Languages
|
2021 |
Edixhoven, Luc |
| Weighted Prefix Normal Words: Mind the Gap
|
2021 |
Eikmeier, Yannik |
| Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata
|
2021 |
Hoffmann, Stefan |
| The Range of State Complexities of Languages Resulting from the Cascade Product—The General Case (Extended Abstract)
|
2021 |
Holzer, Markus |
| Bounded Languages Described by GF(2)-grammars
|
2021 |
Makarov, Vladislav |
| Pointlike Sets and Separation: A Personal Perspective
|
2021 |
Steinberg, Benjamin |
| Lyndon Words Formalized in Isabelle/HOL
|
2021 |
Holub, Štěpán |
| Symmetry Groups of Infinite Words
|
2021 |
Luchinin, Sergey |
| The Hardest LL(k) Language
|
2021 |
Mrykhin, Mikhail |
| Pariıkh Word Representable Graphs and Morphisms
|
2021 |
Thomas, Nobin |
| A Strong Non-overlapping Dyck Code
|
2021 |
Barcucci, Elena |
| Properties of Graphs Specified by a Regular Language
|
2021 |
Diekert, Volker |
| Reducing Local Alphabet Size in Recognizable Picture Languages
|
2021 |
Reghizzi, Stefano Crespi |
| Two-Way Non-uniform Finite Automata
|
2021 |
Frei, Fabian |
| Deciding FO2 Alternation for Automata over Finite and Infinite Words
|
2021 |
Henriksson, Viktor |
| Reversible Top-Down Syntax Analysis
|
2021 |
Kutrib, Martin |
Tag hinzufügen