Skip to main content
SpringerLink
Log in

On the homomorphic characterizations of families of languages

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1979)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 71))

Included in the following conference series:

This research was supported by the Natural Sciences and Engineering Research Council of Canada, Grant No. A 7403.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.V. Book, Comparing Complexity Classes,J. of Comput. Syst. Sci. 9, 1974, 213–229.

    Google Scholar 

  2. K. Culik II, On some families of languages related to developmental systems, Intern. J. Comput. Math 4, 1974, 31–42.

    Google Scholar 

  3. K. Culik II, On the decidability of the sequence equivalence problem for DOL systems, Theoretical Computer Science 3, 1977, 75–84.

    Google Scholar 

  4. K. Culik II, A purely homorphic characterization of recursive enumerable sets, J. ACM (to appear).

    Google Scholar 

  5. 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. 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. S. Eilenberg, Automata, Languages and Machines, Academic Press, 1976.

    Google Scholar 

  8. 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. S. Ginsburg, Algebraic and automata-theoretic properties of formal languages, North Holland, Amsterdam, 1975.

    Google Scholar 

  10. S. Greibach, The hardest context-free language, SIAM J. of Comput. 2, 1973, 304–310.

    Google Scholar 

  11. M.A. Harrison, Introduction to Formal Language Theory, Addison-Wesley, Reading, Mass. 1978.

    Google Scholar 

  12. J.E. Hopcroft and J.D. Ullman, Formal Languages and their Relation to Automata. Addison-Wesley, Reading, Mass. 1969.

    Google Scholar 

  13. B. Wegbreit, A generator of context sensitive languages, J. of Comput. Syst. Sci. 3, 1969, 456–461.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    K. Culik II

Authors
  1. K. Culik II
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hermann A. Maurer

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Culik, K. (1979). On the homomorphic characterizations of families of languages. In: Maurer, H.A. (eds) Automata, Languages and Programming. ICALP 1979. Lecture Notes in Computer Science, vol 71. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09510-1_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-09510-1_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09510-1

  • Online ISBN: 978-3-540-35168-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation