| 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 |
| 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 |
| 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 |
| Geometrically Closed Positive Varieties of Star-Free Languages
|
2020 |
Klima, Ondrej |
| On the Weisfeiler-Leman Dimension of Fractional Packing
|
2020 |
Arvind, Vikraman |
| On Collapsing Prefix Normal Words
|
2020 |
Fleischmann, Pamela |
| Simplified Parsing Expression Derivatives
|
2020 |
Moss, Aaron |
| Approaching Arithmetic Theories with Finite-State Automata
|
2020 |
Haase, Christoph |
Tag hinzufügen