| Fast Detection of Specific Fragments Against a Set of Sequences
|
2023 |
Béal, Marie-Pierre |
| Bit Catastrophes for the Burrows-Wheeler Transform
|
2023 |
Giuliani, Sara |
| Completely Distinguishable Automata and the Set of Synchronizing Words
|
2023 |
Hoffmann, Stefan |
| On the Simon’s Congruence Neighborhood of Languages
|
2023 |
Kim, Sungmin |
| Weak Inverse Neighborhoods of Languages
|
2023 |
Cheon, Hyunjoon |
| The Exact State Complexity for the Composition of Root and Reversal
|
2023 |
Caron, Pascal |
| The Domino Problem Is Undecidable on Every Rhombus Subshift
|
2023 |
Menibus, Benjamin Hellouin de |
| On Word-Representable and Multi-word-Representable Graphs
|
2023 |
Kenkireth, Benny George |
| Rewriting Rules for Arithmetics in Alternate Base Systems
|
2023 |
Masáková, Zuzana |
| Approaching Repetition Thresholds via Local Resampling and Entropy Compression
|
2023 |
Shur, Arseny M. |
| Isometric Words Based on Swap and Mismatch Distance
|
2023 |
Anselmo, M. |
| Synchronization of Parikh Automata
|
2023 |
Hoffmann, Stefan |
| Zielonka DAG Acceptance and Regular Languages over Infinite Words
|
2023 |
Hugenroth, Christopher |
| Synchronizing Automata with Coinciding Cycles
|
2023 |
Ruszil, Jakub |
| Groups Whose Word Problems Are Accepted by Abelian G-Automata
|
2023 |
Yuyama, Takao |
| Formal Languages and the NLP Black Box
|
2023 |
Merrill, William |
| Jumping Automata over Infinite Words
|
2023 |
Almagor, Shaull |
| Set Augmented Finite Automata over Infinite Alphabets
|
2023 |
Banerjee, Ansuman |
| Tree-Walking-Storage Automata
|
2023 |
Kutrib, Martin |
| Languages Generated by Conjunctive Query Fragments of FC[REG]
|
2023 |
Thompson, Sam M. |
Tag hinzufügen