Locally Testable Languages

This paper studies the locally testable languages (or ''events'') introduced by McNaughton and Papert. We characterize these languages by means of their syntactic semigroups and obtain wreath product and direct product decompositions for these semigroups. As a by-product of our study, we find an algebraic characterization of A. Ginzburg's generalized definite languages.

[1]  Magnus steinby.  On definite automata and related systems , 1969 .

[2]  J. Brzozowski.  Canonical regular expressions and minimal state graphs for definite events , 1962 .

[3]  Yechezkel Zalcstein,et al.  Locally Testable Events and Semigroups , 1971 .

[4]  Micha A. Perles,et al.  The Theory of Definite Automata , 1963, IEEE Trans. Electron. Comput..

[5]  Abraham Ginzburg,et al.  About Some Properties of Definite, Reverse-Definite and Related Automata , 1966, IEEE Trans. Electron. Comput..

[6]  Yechezkel Zalcstein,et al.  Locally testable semigroups , 1972 .

[7]  A. Clifford,et al.  The algebraic theory of semigroups , 1964 .

[8]  Michael A. Arbib,et al.  Algebraic theory of machines, languages and semigroups , 1969 .

[9]  Noam Chomsky,et al.  The Algebraic Theory of Context-Free Languages* , 1963 .

[10]  Janusz A. Brzozowski,et al.  Characterizations of locally testable events , 1973, Discret. Math..

[11]  Michael A. Arbib,et al.  Theories of abstract automata , 1969, Prentice-Hall series in automatic computation.

[12]  James W. Thatcher,et al.  Generalized Sequential Machine Maps , 1970, J. Comput. Syst. Sci..

[13]  Marcel Paul Schützenberger,et al.  On Finite Monoids Having Only Trivial Subgroups , 1965, Inf. Control..

[14]  RICHARD MATEOSIAN,et al.  Methods of the Algebraic Theory of Machines. I: Decomposition Theorem for Generalized Machines; Properties Preserved under Series and Parallel Compositions of Machines , 1967, J. Comput. Syst. Sci..