| Space Complexity of Stack Automata Models
|
2020 |
Ibarra, Oscar H. |
| On Tree Substitution Grammars
|
2020 |
Maletti, Andreas |
| Transition Property for x-Power Free Languages with α > 2 and k > 3 Letters
|
2020 |
Rukavicka, Josef |
| Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices
|
2020 |
Prüsa, Daniel |
| Avoiding 5/4-Powers on the Alphabet of Nonnegative Integers (Extended Abstract)
|
2020 |
Rowland, Eric |
| Context-Freeness of Word-MIX Languages
|
2020 |
Sin'Ya, Ryoma |
| Scattered Factor-Universality of Words
|
2020 |
Barker, Laura |
| On Normalish Subgroups of the R. Thompson Groups
|
2020 |
Bleak, Collin |
| Reconstructing Words from Right-Bounded-Block Words
|
2020 |
Fleischmann, Pamela |
| The State Complexity of Lexicographically Smallest Words and Computing Successors
|
2020 |
Fleischer, Lukas |
| Avoidability of Additive Cubes over Alphabets of Four Numbers
|
2020 |
Lietard, Florian |
| Dynamics of Cellular Automata on Beta-Shifts and Direct Topological Factorizations
|
2020 |
Kopra, Johan |
| On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations
|
2020 |
Koechlin, Florent |
| Equivalence of Linear Tree Transducers with Output in the Free Group
|
2020 |
Löbel, Raphaela |
| On the Balancedness of Tree-to-Word Transducers
|
2020 |
Löbel, Raphaela |
| Sublinear-Time Language Recognition and Decision by One-Dimensional with Cellular Automata
|
2020 |
Modanese, Augusto |
| Computing the Shortest String and the Edit-Distance for Parsing Expression Languages
|
2020 |
Cheon, Hyunjoon |
| An Approach to the Herzog-Schönheim Conjecture Using Automata
|
2020 |
Chouraqui, Fabienne |
| A Study of a Simple Class of Modifiers: Product Modifiers
|
2020 |
Caron, Pascal |
| Operations on Permutation Automata
|
2020 |
Hospodár, Michal |
Tag hinzufügen