| On Hardest Languages for One-Dimensional Cellular Automata
|
2021 |
Mrykhin, Mikhail |
| Succinct Representations for (Non)Deterministic Finite Automata
|
2021 |
Chakraborty, Sankardeep |
| Learning Mealy Machines with One Timer
|
2021 |
Vaandrager, Frits |
| Homomorphic Characterization of Tree Languages Based on Comma-Free Encoding
|
2021 |
Crespi Reghizzi, Stefano |
| Approximated Determinisation of Weighted Tree Automata
|
2021 |
Dörband, Frederic |
| On Balanced Sequences and Their Asymptotic Critical Exponent
|
2021 |
Dolce, Francesco |
| Optimising Attractor Computation in Boolean Automata Networks
|
2021 |
Perrot, Kévin |
| On the Power of Nondeterministic Circuits and Co-Nondeterministic Circuits
|
2021 |
Morizumi, Hiroki |
| Partially Directed Animals with a Bounded Number of Holes
|
2021 |
Dorigatti, Valentina |
| Usefulness of Information and Unary Languages
|
2021 |
Pighizzini, Giovanni |
| Completely Reachable Automata, Primitive Groups and the State Complexity of the Set of Synchronizing Words
|
2021 |
Hoffmann, Stefan |
| Location Based Automata for Expressions with Shuffle
|
2021 |
Broda, Sabine |
| Tree-Like Unit Refutations in Horn Constraint Systems
|
2021 |
Subramani, K. |
| State Complexity of the Set of Synchronizing Words for Circular Automata and Automata over Binary Alphabets
|
2021 |
Hoffmann, Stefan |
| Commutative Rational Term Rewriting
|
2021 |
Ishizuka, Mamoru |
| Learnability and Positive Equivalence Relations
|
2021 |
Belanger, David |
| On Language Varieties Without Boolean Operations
|
2021 |
Birkmann, Fabian |
| On the Computational Power of Programs over $$mathsf {BA}_2$$Monoid
|
2021 |
Kulkarni, Manasi S. |
| An Algorithm for Single-Source Shortest Paths Enumeration in Parameterized Weighted Graphs
|
2021 |
Sérée, Bastien |
| On the Transformation of Two-Way Deterministic Finite Automata to Unambiguous Finite Automata
|
2021 |
Petrov, Semyon |
Tag hinzufügen