Streaming Tree Transducers
Strictness of the Collapsible Pushdown Hierarchy
Symbolic dynamics
Synchronizing Automata on Quasi Eulerian Digraph
Syntactic Complexity of Finite/Cofinite, Definite, and Reverse Definite Languages
Syntactic Complexity of Ideal and Closed Languages
Syntactic Complexity of Prefix-, Suffix-, Bifix-, and Factor-Free Regular Languages
Syntactic Complexity of Star-Free Languages
Synthese des Controleurs Optimaux pour les Systemes a Evenements Discrets
Synthesis of Succinct Systems
Systems of Word Equations and Polynomials: a New Approach
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