Skip to main content

Languages with homomorphic replacements

  • Conference paper
  • First Online:

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

Abstract

We introduce H-systems as language generators using the concept of homomorphic replacement of variables by words from metalanguages. This is a generalization of the hypernotion construct in van Wijngaarden grammars with a number of hard open problems. Here we concentrate on the generative power of the language families which result from varying the sets of axioms, resp. the sets of replacements, from ONE through the metalinear languages to CF.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Albert und L. Wegner, Languages with homomorphic replacements, University Karlsruhe, Report No. 88, (1980).

    Google Scholar 

  2. P.R.J. Asveld and J. Engelfriet, Iterated deterministic substitution, Acta Informatica 8, 3 (1977) 285–302.

    Google Scholar 

  3. P. Dembiński and J. Małuszyński, Two level grammars: CF-grammars with equation schemes, Proc. 6th ICALP, Graz, LNCS 71, (1979) 171–187.

    Google Scholar 

  4. A. Ehrenfeucht, G. Rozenberg and S. Skyum, A relationship between ETOL and EDTOL languages, Theoretical Computer Science 1 (1976) 325–330.

    Google Scholar 

  5. J. Engelfriet and E.M. Schmidt, IO and OI, Part I: Journal of Comp. System Sciences 15 (1977) 328–353); Part II: Journal of Comp. Syst. Sciences 16 (1978) 67–99.

    Google Scholar 

  6. J. Engelfriet and S. Skyum, Copying theorems, Inf. Processing Letters, Vol. 5, No. 5 (1976) 157–161.

    Google Scholar 

  7. S. Greibach, Some restrictions on W-grammars, International Journal of Computer and Information Sciences, Vol. 3, No. 4 (1974) 289–327.

    Google Scholar 

  8. J. van Leeuwen, F-iteration languages, University of California, Berkeley, Memorandum (1973).

    Google Scholar 

  9. G.S. Makanin, The problem of solvability of equations in a free semigroup, Russian Matematiceskij sbornik 103 (145), No. 2(6) (1977) 147–236; english summary in: Dokl.Akad.Nauk SSSR, Soviet Math.Dokl., Vol. 18, No. 2 (1977) 330–334.

    Google Scholar 

  10. A. Salomaa, Formal Languages, (Academic Press, New York and London, 1973).

    Google Scholar 

  11. A. Salomaa, Macros, iterated substitution and Lindenmayer-AFL's, University of Aarhus, Denmark, DAIMI PB-18 (1973).

    Google Scholar 

  12. S. Skyum, Decomposition theorems for various kinds of languages parallel in nature, SIAM Journal on Computing, Vol. 5, No. 2 (1976) 284–296.

    Google Scholar 

  13. M. Wand, Mathematical foundations of formal language theory, Mass. Institute of Technology, Report MAC TR-108 (1973).

    Google Scholar 

  14. L. Wegner, Analysis of Two-Level Grammars, Ph.D.Thesis, (Hochschulverlag, Stuttgart, 1977).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jaco de Bakker Jan van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Albert, J., Wegner, L. (1980). Languages with homomorphic replacements. In: de Bakker, J., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 1980. Lecture Notes in Computer Science, vol 85. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10003-2_56

Download citation

  • DOI: https://doi.org/10.1007/3-540-10003-2_56

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10003-4

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics