Equality languages and language families

  • Jürgen Dassow
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 117)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. /Bo/.
    R.V. Book, Simple representations of classes of languages. J. Assoc. Comput. Mach. 25, 23–31 (1978).Google Scholar
  2. /BB/.
    R.V.Book and F.-J.Brandenburg, Equality sets and complexity classes. Techn. report, University of Santa Barbara, 1979.Google Scholar
  3. /Br/.
    F.-J.Brandenburg, Multiple equality sets and Post machines. Techn. report, University of Santa Barbara, 1979.Google Scholar
  4. /Cu/.
    K. Culik II, A purely homomorphic characterization of recursively enumerable sets. J. Assoc. Comput. Mach. 26, 345–350 (1979).Google Scholar
  5. /CD/.
    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. /ER1/.
    J. Engelfriet and G. Rozenberg, Equality languages and fixed point languages. Information and Control 43, 20–49 (1979)Google Scholar
  7. /ER2/.
    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. /GGH/.
    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. /S1/.
    A.Salomaa, Formale Sprachen. Spriger-Verlag, 1978.Google Scholar
  10. /S2/.
    A. Salomaa, Equality sets for homomorphisms of free monoids. Acta Cybernetica 4, 127–139 (1978).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Jürgen Dassow
    • 1
  1. 1.Department of Mathematics and PhysicsTechnological University Otto von GuerickeMagdeburgGerman Democratic Republic

Personalised recommendations