| n this paper, we propose the concept of standard automata for varieties of languages. Standard automata are given for locally testable languages, piecewise testable languages, and p-group languages. We show that a given variety of semigroups is generated by the transition semigroups of a class of standard automata for the corresponding language variety, cf. S4.1.;Instead of developing a theory of standard automata in its own right, we immediately turn to test the usefulness of the concept in applications. We give a more elegant and easier to understand proof of the equation... |
