New aspects of homomorphisms

  • H. Maurer
Part of the Lecture Notes in Computer Science book series (LNCS, volume 67)


Homomorphisms have played an important role throughout the development of language theory. In the last years, new areas of language theory have been developed based on homomorphisms. We survey some recent results in such areas: Starting with the DOL equivalence problem we first mention the notions of homomorphism equivalence and equality sets, and their application to homomorphic representation theorems. We then use lengthpreserving homomorphisms to define grammatical similarity and discuss some striking results from the fast growing area of grammar forms and L forms.


Equivalence Problem Language Theory Language Family Grammar Form Normal Form Theorem 
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. [AM]
    Albert, J., Maurer, H.: The class of context-free languages is not an EOL family; Information Processing Letters 6 (1977), 190–195.CrossRefGoogle Scholar
  2. [AM2]
    Ainhirn,W., Maurer,H.: On ɛ-productions in EOL forms; IIG-Technical University of Graz, Manuscript (1978).Google Scholar
  3. [AMR]
    Albert,J., Maurer,H., Rozenberg,G.: Simple EOL forms under uniform interpretation generating CF languages; Fundamenta Informatica (to appear).Google Scholar
  4. [C]
    Culik II,K.: On the decidability of the sequence equivalence problem for DOL systems; Theoretical Computer Science 3 (1977), 75–84.CrossRefGoogle Scholar
  5. [C2]
    Culik II,K.: The ultimate equivalence problem for DOL systems; Acta Informatica 10 (1978), 79–84.CrossRefGoogle Scholar
  6. [C3]
    Culik II, K.: A purely homomorphic characterization of recursively enumerable sets; Journal of the ACM (to appear).Google Scholar
  7. [CF]
    Culik II,K., Fris, I.: The decidability of the equivalence problem for DOL systems; Information and Control 35 (1977), 20–39.CrossRefGoogle Scholar
  8. [CG]
    Cremers, A.B., Ginsburg, S.: Context-free grammar forms; Journal of Computer and Systems Sciences 11 (1975), 86–119.Google Scholar
  9. [CM]
    Culik II,K., Maurer,H.: On simple representations of language families; University of Waterloo Report CS-78-41 (1978).Google Scholar
  10. [CM2]
    Culik II,K., Maurer, H.: Propagating chain-free normal forms for EOL systems; Information and Control 36 (1978), 309–319.CrossRefGoogle Scholar
  11. [CMO]
    Culik II,K., Maurer, H., Ottmann, Th.: On two symbol complete EOL forms; Theoretical Computer Science 6 (1978), 69–92.CrossRefGoogle Scholar
  12. [CMORS]
    Culik II,K., Maurer, H., Ottmann, Th., Ruohonen, K., Salomaa, A.: Isomorphism, form equivalence and sequence equivalence of PDOL forms; Theoretical Computer Science 6 (1978), 143–173.CrossRefGoogle Scholar
  13. [CS]
    Culik II,K., Salomaa,A.: On the decidability of homomorphism equivalence for languages; University of Waterloo Report CS-77-26 (1977).Google Scholar
  14. [ER]
    Ehrenfeucht, A., Rozenberg, G.: Elementary homomorphisms and a solution of the DOL sequence equivalence problem; Theoretical Computer Science 7 (1978), 169–183.CrossRefGoogle Scholar
  15. [ER2]
    Engelfriet,J., Rozenberg,G.: Fixed point languages, equality languages and representations of recursively enumberable languages; FOCS (1978), 123–126.Google Scholar
  16. [G]
    Ginsburg,S.: A survey of grammar forms — 1977; Manuscript (1977).Google Scholar
  17. [G]
    Ginsburg,S.: Private communication (1977).Google Scholar
  18. [H]
    Harrison, M.: Introduction to formal language theory; Addison Wesley, Reading (1978).Google Scholar
  19. [HR]
    Herman, G.I., Rozenberg, G.: Developmental systems and languages; North Holland, Amsterdam (1975).Google Scholar
  20. [K]
    Karhumäki, J.: The decidability of the equivalence problem for polynomially bounded DOL sequences; RAIRO, Ser. Rouge 11 (1977), 17–28.Google Scholar
  21. [L]
    Lindenmayer, A.: Mathematical Models for cellular interactions in development; Journal of Theoretical Biology 18 (1968), 280–315.CrossRefPubMedGoogle Scholar
  22. [M]
    Maurer,H.: Theoretische Grundlagen der Programmiersprachen — Theorie der Syntax; BI, Mannheim (1969).Google Scholar
  23. [MOS]
    Maurer, H., Ottmann, Th., Salomaa, A.: On the form equivalence of L forms; Theoretical Computer Science 4 (1977), 199–225.CrossRefGoogle Scholar
  24. [MSW1]
    Maurer, H., Salomaa, A., Wood, D.: EOL forms; Acta Informatica 8 (1977), 75–96.Google Scholar
  25. [MSW2]
    Maurer,H., Salomaa,A., Wood,D.: Context-free grammar forms with strict interpretations; IIG-Technical University of Graz, Report 19 (1978).Google Scholar
  26. [MSW3]
    Maurer,H., Salomaa,A., Wood,D.: Strict context-free grammar forms: completeness and decidability; IIG-Technical University of Graz, Report 20 (1978).Google Scholar
  27. [MSW4]
    Maurer,H., Salomaa,A., Wood,D.: On generators and generative capacity of EOL forms; IIG-Technical University of Graz, Report 5 (1978).Google Scholar
  28. [MSW5]
    Maurer, H., Salomaa, A., Wood, D.: Uniform interpretations of L forms; Information and Control 36 (1978), 157–173.CrossRefGoogle Scholar
  29. [MSW6]
    Maurer,H., Salomaa,A., Wood,D.: Synchronized EOL forms under uniform interpretation; McMaster University Report 78-CS-11 (1978).Google Scholar
  30. [MSW7]
    Maurer, H., Salomaa, A., Wood, D.: On good EOL forms; SIAM Journal on Computing 7 (1978), 158–166.CrossRefGoogle Scholar
  31. [MSW8]
    Maurer,H., Salomaa,A., Wood,D.: Relative goodness of EOL forms; RAIRO, series rouge (to appear).Google Scholar
  32. [N]
    Nivat, M.: Extensions et restrictions des grammaires algebriques; In: Formal Languages and Programming (ed. R. Aguilar) North Holland, Amsterdam (1976) 83–96.Google Scholar
  33. [N2]
    Nielsen, M.: On the decidability of some equivalence probelems for DOL systems; Information and Control 25 (1974), 166–193.CrossRefGoogle Scholar
  34. [R]
    Rozenberg, G.: L systems, sequences and languages; Lecture Notes in Computer Science 34 (1975), 71–84Google Scholar
  35. [RS1]
    Rozenberg, G., Salomaa, A.: The mathematical theory of L systems; In: Advances in Information Systems Sciences (J.Tou, Ed.) 6 (1976), 160–200.Google Scholar
  36. [RS2]
    Rozenberg,G., Salomaa,A.: The mathematical theory of L systems; forthcoming.Google Scholar
  37. [S]
    Salomaa,A.: Formal languages; Academic Press (1973).Google Scholar
  38. [S2]
    Salomaa, A.: DOL equivalence: the problem of iterated morphisms; EATCS Bulletin 4 (1978), 5–12.Google Scholar
  39. [S3]
    Salomaa,A.: Equality sets for homomorphisms of free monoids; Acta Cybernetica (to appear).Google Scholar
  40. [SS]
    Salomaa,A., Soittola,M.: Automata theoretic aspects of formal power series; Springer Verlag (1978).Google Scholar
  41. [W]
    Wood,D.: Grammar and L forms (in preparation).Google Scholar
  42. [W2]
    Wood, D.: Bibliography of grammatical similarity; EATCS Bulletin 5 (1978), 15–22.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • H. Maurer

There are no affiliations available

Personalised recommendations