The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata
The state complexity of star-complement-star
Theory of Atomata
Toward a Compositional Theory of Leftist Grammars and Transformations
Towards Nominal Formal Languages
Traced communication complexity of cellular automata
Transformations Between Different Types of Unranked Bottom-Up Tree Automata
Transition Complexity of Incomplete DFAs
Translation from Classical Two-Way Automata to Pebble Two-Way Automata
Treating Insomnia, Amnesia, and Acalculia in Regular Expression Matching
Tree Languages Defined in First-Order Logic with One Quantifier Alternation
Tree Regular Model Checking for Lattice-Based Automata
Turing Automata and Graph Machines
Two-Way Automata Making Choices Only at the Endmarkers