Skip to main content
SpringerLink
Log in

Hotz-isomorphism theorems in formal language theory

  • Contributed Papers
  • Conference paper
  • First Online:
STACS 88 (STACS 1988)

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

Included in the following conference series:

Abstract

A language \(L \subseteq X*\)is called a language with a Hotz-isomorphism if there is a generating grammar such that its Hotz group is canonically isomorphic to F(X)/L. The main result of the paper states that L is a language with a Hotz-isomorphism if and only if F(X)/L is a finitely presentable group. We also prove an analogous result for Hotz-monoids. Further, we show when the construction of a grammar which allows the Hotz-isomorphism is effective; and we prove various undecidability results concerning this construction.

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. Clifford, A., Preston, G.: The algebraic theory of semigroups, Amer. Math. Soc, vol. I:1961, vol. II:1967

    Google Scholar 

  2. Diekert, V.: On Hotz-groups and homomorphic images of sentential form languages. In: Proc. of the 2nd Annual Symp. on Theoret. Aspects of Comp. Sci., Saarbrücken, January 3–5, 1985. Ed. K. Mehlhorn, Lect. Notes in Comp. Sci. 182 (1985), 87–97

    Google Scholar 

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

    Google Scholar 

  4. Diekert, V.: On some variants of the Ehrenfeucht conjecture, Theoret.Comp. Sci. 46 (1986), 313–318

    Google Scholar 

  5. Frougny, C., Sakarovitch, J., Valkema, E.: On the Hotz-group of a context-free grammar, Acta Informatica 18 (1982), 109–115

    Google Scholar 

  6. Hotz, G.: Eine neue Invariante für kontext-freie Sprachen, Theoret. Comp. Sci. 11 (1980), 107–116

    Google Scholar 

  7. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation, Addison-Wesley: Massachusetts 1979

    Google Scholar 

  8. Möbus, A.: On languages with a Hotz-isomorphism (Manuscript 1986)

    Google Scholar 

  9. Serre, J.P: Cohomologie galoisienne, Lect.Notes in Math. 5, Springer: 1965

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik der Technischen Universität München, Arcisstr. 21, D-8000, München 2

    Volker Diekert

  2. Mathematisches Institut der Universität Düsseldorf, Universitätsstr. 1, D-4000, Düsseldorf

    Axel Möbus

Authors
  1. Volker Diekert
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Axel Möbus
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Robert Cori Martin Wirsing

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Diekert, V., Möbus, A. (1988). Hotz-isomorphism theorems in formal language theory. In: Cori, R., Wirsing, M. (eds) STACS 88. STACS 1988. Lecture Notes in Computer Science, vol 294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035839

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18834-6

  • Online ISBN: 978-3-540-48190-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation