| 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 |
| Containment and Equivalence of Weighted Automata: Probabilistic and Max-Plus Cases
|
2020 |
Daviaud, Laure |
| Deciding Classes of Regular Languages: The Covering Approach
|
2020 |
Place, Thomas |
| The Automatic Baire Property and an Effective Property of o-Rational Functions
|
2020 |
Finkel, Olivier |
| Input Strictly Local Tree Transducers
|
2020 |
Ji, Jing |
| How to Prove that a Language Is Regular or Star-Free?
|
2020 |
Pin, Jean-Éric |
| Ordered Semiautomatic Rings with Applications to Geometry
|
2020 |
Gao, Ziyuan |
| On the Size of Depth-Two Threshold Circuits for the Inner Product Mod 2 Function
|
2020 |
Amano, Kazuyuki |
Tag hinzufügen