| Second-order finite automata: expressive power and simple proofs using automatic structures
|
2021 |
Kuske, Dietrich |
| Compositions of Constant Weighted Extended Tree Transducers
|
2021 |
Blattmann, Malte |
| Active Learning of Sequential Transducers with Side Information About the Domain
|
2021 |
Berthon, Raphaël |
| State Complexity of Projection on Languages Recognized by Permutation Automata and Commuting Letters
|
2021 |
Hoffmann, Stefan |
| Integer Weighted Automata on Infinite Words
|
2021 |
Halava, Vesa |
| Definability Results for Top-Down Tree Transducers
|
2021 |
Maneth, Sebastian |
| A Linear-Time Simulation of Deterministic d-Limited Automata
|
2021 |
Rubtsov, Alexander A. |
| Upper Bounds on Distinct Maximal (Sub-)Repetitions in Compressed Strings
|
2021 |
Pape-Lange, Julian |
| Branching Frequency and Markov Entropy of Repetition-Free Languages
|
2021 |
Petrova, Elena A. |
| 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 |
Tag hinzufügen