Skip to main content
Springer Nature Link
Log in

Equality languages and language families

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1981)

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

Included in the following conference series:

  • 156 Accesses

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, Simple representations of classes of languages. J. Assoc. Comput. Mach. 25, 23–31 (1978).

    Google Scholar 

  2. R.V.Book and F.-J.Brandenburg, Equality sets and complexity classes. Techn. report, University of Santa Barbara, 1979.

    Google Scholar 

  3. F.-J.Brandenburg, Multiple equality sets and Post machines. Techn. report, University of Santa Barbara, 1979.

    Google Scholar 

  4. K. Culik II, A purely homomorphic characterization of recursively enumerable sets. J. Assoc. Comput. Mach. 26, 345–350 (1979).

    Google Scholar 

  5. K.Culik II and N.D.Diamond, A homomorphic characterization of time and space complexity classes of languages. Techn. report, University of Waterloo, 1979.

    Google Scholar 

  6. J. Engelfriet and G. Rozenberg, Equality languages and fixed point languages. Information and Control 43, 20–49 (1979)

    Google Scholar 

  7. J.Engelfriet and G.Rozenberg, Fixed point languages, equality languages and representations of recursively enumerable languages. J. Assoc. Comput. Mach., to appear.

    Google Scholar 

  8. S.Ginsburg, S.Greibach, and J.Hopcroft, Studies in Abstract Families of Languages. Memoris of the Amer. Math. Soc., No. 87, 1969.

    Google Scholar 

  9. A.Salomaa, Formale Sprachen. Spriger-Verlag, 1978.

    Google Scholar 

  10. A. Salomaa, Equality sets for homomorphisms of free monoids. Acta Cybernetica 4, 127–139 (1978).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Physics, Technological University Otto von Guericke, Magdeburg, German Democratic Republic

    Jürgen Dassow

Authors
  1. Jürgen Dassow
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ferenc Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dassow, J. (1981). Equality languages and language families. In: Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1981. Lecture Notes in Computer Science, vol 117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10854-8_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-10854-8_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10854-2

  • Online ISBN: 978-3-540-38765-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics