Regular languages, languages computed by finite automata, are among the simplest objects
in theoretical computer science. This thesis explores several computation models: parallel …

We give a simple new proof that regular languages defined by first-order sentences with no
quantifier alteration can be defined by such sentences in which only regular atomic formulas …