On the homomorphic characterizations of families of languages

  • K. CulikII
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 71)


Turing Machine Language Family Formal Language Theory Enumerable Language Principal Cone 
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. [B]
    R.V. Book, Comparing Complexity Classes,J. of Comput. Syst. Sci. 9, 1974, 213–229.Google Scholar
  2. [C1]
    K. Culik II, On some families of languages related to developmental systems, Intern. J. Comput. Math 4, 1974, 31–42.Google Scholar
  3. [C2]
    K. Culik II, On the decidability of the sequence equivalence problem for DOL systems, Theoretical Computer Science 3, 1977, 75–84.Google Scholar
  4. [C3]
    K. Culik II, A purely homorphic characterization of recursive enumerable sets, J. ACM (to appear).Google Scholar
  5. [CD]
    K. Culik II and N. Diamond, A homomorphic characterization of time and space complexity classes of languages. Submitted to Intern. J. Comput. Math., also University of Waterloo Research Report CS-79-07, February 1979.Google Scholar
  6. [CM]
    K. Culik II and H.A. Maurer, On simple representations of language families, Revue Francaise d'Automatique, Informatique et Recherche Operationnelle, to appear.Google Scholar
  7. [E]
    S. Eilenberg, Automata, Languages and Machines, Academic Press, 1976.Google Scholar
  8. [ER]
    J. Engelfriet and G. Rozenberg, Equality languages, fixed point languages and representations of recursively enumerable languages, 19th Annual Symposium on Foundations of Computer Science, 1978, 123–126.Google Scholar
  9. [Gi]
    S. Ginsburg, Algebraic and automata-theoretic properties of formal languages, North Holland, Amsterdam, 1975.Google Scholar
  10. [Gr]
    S. Greibach, The hardest context-free language, SIAM J. of Comput. 2, 1973, 304–310.Google Scholar
  11. [H]
    M.A. Harrison, Introduction to Formal Language Theory, Addison-Wesley, Reading, Mass. 1978.Google Scholar
  12. [HU]
    J.E. Hopcroft and J.D. Ullman, Formal Languages and their Relation to Automata. Addison-Wesley, Reading, Mass. 1969.Google Scholar
  13. [W]
    B. Wegbreit, A generator of context sensitive languages, J. of Comput. Syst. Sci. 3, 1969, 456–461.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • K. CulikII
    • 1
  1. 1.Department of Computer ScienceUniversity of WaterlooWaterlooCanada

Personalised recommendations