| Recompression: Technique for Word Equations and Compressed Data
|
2020 |
Jez, Artur |
| Nonstandard Cayley Automatic Representations for Fundamental Groups of Torus Bundles over the Circle
|
2020 |
Berdinsky, Dmitry |
| Alternating Finite Automata with Limited Universal Branching
|
2020 |
Keeler, Chris |
| Expressiveness and Conciseness of Timed Automata for the Verification of Stochastic Models
|
2020 |
Donatelli, Susanna |
| Cyclic Shift on Multi-component Grammars
|
2020 |
Okhotin, Alexander |
| The Power of Programs over Monoids in J
|
2020 |
Grosshans, Nathan |
| Lyndon Words versus Inverse Lyndon Words: Queries on Suffixes and Bordered Words
|
2020 |
Bonizzoni, Paola |
| Approaching Arithmetic Theories with Finite-State Automata
|
2020 |
Haase, Christoph |
| (R, +, <,1) Is Decidable in (R, +, <,Z)
|
2020 |
Bes, Alexis |
| Windable Heads and Recognizing NL with Constant Randomness
|
2020 |
Gezer, Mehmet Utkan |
| Boolean Monadic Recursive Schemes as a Logical Characterization of the Subsequential Functions
|
2020 |
Bhaskar, Siddharth |
| Pebble-Intervals Automata and FO2 with Two Orders
|
2020 |
Labai, Nadia |
| Limited Two-Way Deterministic Finite Automata with Advice
|
2020 |
Ucan, Ahmet Bilal |
| Complexity of Automatic Sequences
|
2020 |
Zantema, Hans |
| Context-Sensitive Fusion Grammars Are Universal
|
2020 |
Lye, Aaron |
| Complexity Issues of String to Graph Approximate Matching
|
2020 |
Dondi, Riccardo |
| Intersection and Union Hierarchies of Deterministic Context-Free Language and Pumping Lemmas
|
2020 |
Yamakami, Tomoyuki |
| Reducing the Ambiguity of Parikh Matrices
|
2020 |
Dick, Jeffery |
| Complete Variable-Length Codes: An Excursion into Word Edit Operations
|
2020 |
Néraud, Jean |
| The New Complexity Landscape Around Circuit Minimization
|
2020 |
Allender, Eric |
Tag hinzufügen