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