| 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 |
| Carathéodory Extensions of Subclasses of Regular Languages
|
2021 |
ya, Ryoma Sin |
| 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 |
Tag hinzufügen