A characterization of a dot-depth two analogue of generalized definite languages

  • Faith E. Fich
  • J. A. Brzozowski
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 71)


The family of G-trivial languages is investigated. This family is a generalization of L-trivial and R-trivial languages, a relationship analogous to the one between generalized definite languages and the definite and reverse definite languages. Characterizations of G-trivial languages are given in terms of their syntactic monoids, various congruence relations, and the (finite) automata which recognize them. Finally, we examine noncounting languages and their connection to G-trivial languages.


Transitive Closure Finite Index Congruence Class Left Zero Definite Language 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Brzozowski, J.A., Canonical Regular Expressions and Minimal State Graphs for Definite Events, Mathematical Theory of Automata, New York, 1962, 529–561.Google Scholar
  2. [2]
    Brzozowski, J.A., Hierarchies of Aeriodic Languages, R.A.I.R.O. Information Théorique 10 (1976), 35–49.Google Scholar
  3. [3]
    Brzozowski, J.A., A Generalization of Finiteness, Semigroup Forum 13 (1977), 239–251.Google Scholar
  4. [4]
    Brzozowski, J.A., Culik, K., and Gabrielian, A., Classification of Noncounting Events, J. Comput. System Sci. 5 (1971), 41–53.Google Scholar
  5. [5]
    Brzozowski, J.A., and Fich, F.E., Languages of R-Trivial Monoids, to appear in J. Comput. System Sci.Google Scholar
  6. [6]
    Brzozowski, J.A. and Knast, R., The Dot-Depth Hierarchy of Star-Free Languages is Infinite, J. Comput. System Sci. 16 (1978), 37–55.Google Scholar
  7. [7]
    Brzozowski, J.A., and Simon, I., Characterizations of Locally Testable Events, Discrete Mathematics 4 (1973), 243–271.Google Scholar
  8. [8]
    Cohen, R.S., and Brzozowski, J.A., Dot Depth of Star-Free Events, J. Comput. System Sci. 5 (1971), 1–16.Google Scholar
  9. [9]
    Eilenberg, S., Automata, Languages, and Machines, Volume B, Academic Press, New York, 1976.Google Scholar
  10. [10]
    Fich, F.E., Languages of R-Trivial and Related Monoids, M.Math. thesis, Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada, 1979.Google Scholar
  11. [11]
    Ginzburg, A., About Some Properties of Definite, Reverse-Definite, and Related Automata, IEEE Trans. Electronic Computers EC-15 (1966), 806–810.Google Scholar
  12. [12]
    Green, J.A., and Rees, D., On Semigroups in which x′=x, Proc. Cambridge Philos. Soc. 48 (1952), 35–40.Google Scholar
  13. [13]
    Kleene, S.C., Representation of Events in Nerve Nets and Finite Automata, in Automata Studies, Annals of Mathematics Studies 34, C.E. Shannon and J. McCarthy (eds.), Princeton University Press, Princeton, N.J., 1956, 3–40.Google Scholar
  14. [14]
    McNaughton, R., and Papert, S., Counter-Free Automata, The M.I.T. Press, Cambridge, Mass., 1971.Google Scholar
  15. [15]
    Meyer, A.R., A Note on Star-Free Events, J. ACM 16 (1969), 220–225.Google Scholar
  16. [16]
    Papert, S. and McNaughton, R., On Topological Events, in Theory of Automata, University of Michigan Engineering Summer Conference, Ann Arbor, Mich., 1966.Google Scholar
  17. [17]
    Perles, M., Rabin, M.O., and Shamir, E., The Theory of Definite Automata, IEEE Trans. on Electronic Computers EC-12 (1963), 233–243.Google Scholar
  18. [18]
    Perrin, D., Sur Certains Semigroups Syntaxiques, Séminaires de P.I.R.I.A. Logiques et Automates, 1971, 169–177.Google Scholar
  19. [19]
    Schützenberger, M.P., On Finite Monoids Having Only Trivial Subgroups, Information and Control 8 (1965), 190–194.Google Scholar
  20. [20]
    Simon, I., Hierarchies of Events with Dot-Depth One, Ph.D. thesis, Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada, 1972.Google Scholar
  21. [21]
    Simon, I., Piecewise Testable Events, in Automata Theory and Formal Languages, 2nd GI Conference, H. Brakhage (ed.), Lecture Notes in Computer Science 33, Springer-Verlag, Berlin, 1975, 214–222.Google Scholar
  22. [22]
    Steinby, M., On Definite Automata and Related Systems, Ann. Acad. Sci. Fenn. Ser. AI 444, 1969.Google Scholar
  23. [23]
    Zalcstein, Y., Locally Testable Languages, J. Comput. System Sci. 6 (1972), 151–167.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • Faith E. Fich
    • 1
  • J. A. Brzozowski
    • 2
  1. 1.Computer Science DivisionUniversity of CaliforniaBerkeley
  2. 2.Department of Computer ScienceUniversity of WaterlooWaterlooCanada

Personalised recommendations