Testing the Equivalence of Regular Languages
The averaging trick and the Cerny conjecture
The Cerny Conjecture
The Cerny conjecture for one-cluster automata with prime length cycle
The Complexity of Codiagnosability for Discrete Event and Timed Systems
The Complexity of Finding Reset Words in Finite Automata
The Complexity of Translation Membership for Macro Tree Transducers
The Critical Exponent is Computable for Automatic Sequences
The Dissecting Power of Regular Languages
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