Skip to main content
SpringerLink
Log in

Homomorphic images of sentential forms and terminating grammars (extended abstract)

  • Contributed Papers
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1997 (MFCS 1997)

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

  • 96 Accesses

Abstract

We consider languages generated as homomorphic images of sentential form languages and related grammars. A characterization of these languages in terms of their topological properties is given. Previous hierarchy results are strengthened by constructing separating languages over a single letter alphabet. The relation to languages generated by terminating grammars is investigated.

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. J. R. Büchi. Regular canonical systems. Archiv Math. Logik and Grundlagenforschung, 6:91–111, 1964.

    Article  Google Scholar 

  2. J. Dassow and G. Păun. Regulated Rewriting in Formal Language Theory, volume 18 of EATCS Monographs on Theoretical Computer Science. Springer, BerlinHeidelberg-New York, 1989.

    Google Scholar 

  3. V. Diekert. Investigations on Hotz groups for arbitrary grammars. Acta Informatica, 22:679–698, 1986.

    Article  Google Scholar 

  4. A. Ehrenfeucht and G. Rozenberg. Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems. Acta Informatica, 3:265–283, 1974.

    Article  Google Scholar 

  5. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading Mass., 1979.

    Google Scholar 

  6. M. Jantzen and M. Kudlek. Homomorphic images of sentential form languages defined by semi-Thue systems. Theoretical Computer Science, 33:13–43, 1984.

    Article  Google Scholar 

  7. H. A. Maurer, A. Salomaa, and D. Wood. Pure grammars. Information and Control, 44:47–72, 1980.

    Article  Google Scholar 

  8. J. I. Seiferas. Relating refined space complexity classes. Journal of Computer and System Sciences, 14:100–129, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Stuttgart, Breitwiesenstr. 20-22, D-70565, Stuttgart

    Holger Petersen

Authors
  1. Holger Petersen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Igor Prívara Peter Ružička

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Petersen, H. (1997). Homomorphic images of sentential forms and terminating grammars (extended abstract). In: Prívara, I., Ružička, P. (eds) Mathematical Foundations of Computer Science 1997. MFCS 1997. Lecture Notes in Computer Science, vol 1295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029988

Download citation

  • DOI: https://doi.org/10.1007/BFb0029988

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63437-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation