Linked e-resources
Details
Table of Contents
Finite automata as verifiers
Binary Coded Unary Regular Languages
A Survey on Automata with Translucent Letters
Earliest Query Answering for Deterministic Stepwise Hedge Automata
Constrained Multi-Tildes
On the smallest synchronizing terms of finite tree automata
Universal First-Order Quantification over Automata
Average Complexity of Partial Derivatives for Synchronised Shuffle Expressions
Sweep complexity revisited
The Pumping Lemma for Regular Languages is Hard
M-equivalence of Parikh Matrix over a Ternary Alphabet
Operational Complexity in Subregular Classes
When Is Context-Freeness Distinguishable from Regularity? An Extension of Parikh's Theorem
Enhanced Ternary Fibonacci Codes
Sweeping Input-Driven Pushdown Automata
Verified Verifying: SMT-LIB for Strings in Isabelle
Weighted Bottom-up and Top-down Tree Transformations Are Incomparable
Deciding whether an Attributed Translation can be realized by a Top-Down Transducer
A time to cast away stones
Two-way Machines and de Bruijn Words
Transduction of Automatic Sequences and Applications
Measuring Power of Generalised Definite Languages
Smaller Representation of Compiled Regular Expressions.
Binary Coded Unary Regular Languages
A Survey on Automata with Translucent Letters
Earliest Query Answering for Deterministic Stepwise Hedge Automata
Constrained Multi-Tildes
On the smallest synchronizing terms of finite tree automata
Universal First-Order Quantification over Automata
Average Complexity of Partial Derivatives for Synchronised Shuffle Expressions
Sweep complexity revisited
The Pumping Lemma for Regular Languages is Hard
M-equivalence of Parikh Matrix over a Ternary Alphabet
Operational Complexity in Subregular Classes
When Is Context-Freeness Distinguishable from Regularity? An Extension of Parikh's Theorem
Enhanced Ternary Fibonacci Codes
Sweeping Input-Driven Pushdown Automata
Verified Verifying: SMT-LIB for Strings in Isabelle
Weighted Bottom-up and Top-down Tree Transformations Are Incomparable
Deciding whether an Attributed Translation can be realized by a Top-Down Transducer
A time to cast away stones
Two-way Machines and de Bruijn Words
Transduction of Automatic Sequences and Applications
Measuring Power of Generalised Definite Languages
Smaller Representation of Compiled Regular Expressions.