Descriptional complexity of bounded context-free languages

Descriptional Complexity of the Languages KaL: Automata, Monoids and Varieties

Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvement

Detecting patterns in finite regular and context-free languages

Deterministic pushdown automata and unary languages

Determinization of $ω$-automata unified

Dynamic Observers for Fault Diagnosis of Timed Systems

Dynamical generalizations of the Lagrange spectrum

Efficient Analysis of Probabilistic Programs with an Unbounded Counter

Efficient Divide-and-Conquer Implementations Of Symmetric FSAs

Enumerating Finitary Processes

Enumerating regular expressions and their languages

Enumeration and Decidable Properties of Automatic Sequences

Enumeration and Structure of Trapezoidal Words

Enumeration Order Reducibility

Equational theories of profinite structures

Evolving MultiAlgebras unify all usual sequential computation models

Exact generation of acyclic deterministic finite automata

Experimental Study of the Shortest Reset Word of Random Automata

Fast algorithm finding the shortest reset words