The equality problem for infinite words generated by primitive morphisms
The FC-rank of a context-free language
The growth function of S-recognizable sets
The Join Levels of the Trotter-Weil Hierarchy are Decidable
The Join of R-trivial and L-trivial Monoids via Combinatorics on Words
The Magic Number Problem for Subregular Language Families
The Maximal Subword Complexity of Quasiperiodic Infinite Words
The Morphisms With Unstackable Image Words
The non-abelian squares are not context-free
The Nondeterministic Waiting Time Algorithm: A Review
The Rank and Hanna Neumann Property of Some Submonoids of a Free Monoid
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