Taylor J. Smith

.- CONTRIBUTED PAPERS :   .- Efficiently Testing Emptiness of Automata on Linear Orderings.  .- Boolean Products of Languages.  .- Bandwidth of nondeterministic finite automata.  .- The Stanat-Weiss Pumping Lemma, Revisited (Extended Abstract).  .- Decidability of Regularity for Families of Languages.  .- Impartial Derivation Games on Context-Free Grammars.  .- Decomposing regular languages under shuffle along trajectories.  .- Pattern matching under R-congruence.  .- Hyper-Minimization for Deterministic Register Automata.  .- On the state complexity...