论文信息 - On generalized locally testable languages

On generalized locally testable languages

Abstract This paper discusses a family of star-free languages, over a two letter alphabet, which generalizes both the locally testable languages and the G -trivial languages. Characterizations are given in terms of congruences, monoids, and semiautomata.

Faith Ellen | Janusz A. Brzozowski

[1] Janusz A. Brzozowski,et al. A generalization of finiteness , 1976 .

[2] Faith Ellen,et al. Languages of R-Trivial Monoids , 1980, J. Comput. Syst. Sci..

[3] Faith Ellen,et al. A Characterization of a Dot-Depth Two Analogue of Generalized Definite Languages , 1979, ICALP.

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

[5] Samuel Eilenberg,et al. Automata, languages, and machines. A , 1974, Pure and applied mathematics.