Treating Insomnia, Amnesia, and Acalculia in Regular Expression Matching

Tree Languages Defined in First-Order Logic with One Quantifier Alternation

Tree Regular Model Checking for Lattice-Based Automata

Turing Automata and Graph Machines

Two-Way Automata Making Choices Only at the Endmarkers

Unambiguous 1-Uniform Morphisms

Undecidability Results for Finite Interactive Systems

Uniformly balanced words with linear complexity and prescribed letter frequencies

Unique decodability of bigram counts by finite automata

Wave propagation in filamental cellular automata

Weak Mso with the Unbounding Quantifier

Weighted Automata and Recurrence Equations for Regular Languages

Zigzags in Turing machines