| Can Formal Languages Help Pangenomics to Represent and Analyze Multiple Genomes?
|
2022 |
Bonizzoni, Paola |
| Checking Regular Invariance Under Tightly-Controlled String Modifications
|
2022 |
Aiswarya, C. |
| A Survey on Delegated Computation
|
2022 |
Crescenzo, Giovanni Di |
| Deciding Atomicity of Subword-Closed Languages
|
2022 |
Atminas, Aistis |
| Preservation of Normality by Unambiguous Transducers
|
2022 |
Carton, Olivier |
| Logarithmic Equal-Letter Runs for BWT of Purely Morphic Words
|
2022 |
Frosini, Andrea |
| Visit-Bounded Stack Automata
|
2022 |
Jirásek, Jozef |
| On the Complexity of Decision Problems for Counter Machines with Applications to Coding Theory
|
2022 |
Ibarra, Oscar H. |
| Performing Regular Operations with 1-Limited Automata
|
2022 |
Pighizzini, Giovanni |
| Kolmogorov Complexity Descriptions of the Exquisite Behaviors of Advised Deterministic Pushdown Automata
|
2022 |
Yamakami, Tomoyuki |
| A Full Characterization of Bertrand Numeration System
|
2022 |
Charlier, Émilie |
| Column Representation of Sturmian Words in Cellular Automata
|
2022 |
Dolce, Francesco |
| The Billaud Conjecture for ∑ = 4, and Beyond
|
2022 |
Łopaciuk, Szymon |
| Binomial Complexities and Parikh-Collinear Morphisms
|
2022 |
Rigo, Michel |
| Measuring Power of Locally Testable Languages
|
2022 |
'ya, Ryoma Sin |
| The Power Word Problem in Graph Products
|
2022 |
Stober, Florian |
| Word Equations in the Context of String Solving
|
2022 |
Day, Joel D. |
| Prefix Palindromic Length of the Sierpinski Word
|
2022 |
Bulgakova, Dora |
| On the Decidability of Infix Inclusion Problem
|
2022 |
Cheon, Hyunjoon |
| Automata-Theoretical Regularıty Characterizations for the Iterated Shuffle on Commutative Regular Languages
|
2022 |
Hoffmann, Stefan |
Tag hinzufügen