Skip to main content
SpringerLink
Log in

On the Hotz group of a context-free grammar

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

This note gives a new and algebraic construction of the Hotz group of a context-free grammar. The main result, that the Hotz group is defined by the generated language, as well as the relationships between this group and the syntactic monoid of the language are then easy consequences of this presentation.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Anisimov, A.V., Seifert, F.D.: Zur algebraischen Charakteristik der durch kontextfreie Sprachen definierten Gruppen. Elektronische Informationsverarbeitung und Kybernetik11, 695–702 (1975)

    Google Scholar 

  2. Boasson, L.: Dérivations et réductions dans les grammaires algébriques. In: Proc. of the 7th I.C.A.L.P., Lecture Notes in Computer Science85, 109–118 (1980)

    Google Scholar 

  3. Clifford, A., Preston, G.: The algebraic theory of semigroups. Amer. Math. Soc., Vol.1 (1961), Vol.2 (1967)

  4. Frougny, Ch.: Simple deterministic NTS languages. Information Processing Letters12 (4), 174–178 (1981)

    Google Scholar 

  5. Harrison, M.: Introduction to Formal Language Theory. Addison Wesley 1978

  6. Hotz, G.: Eine neue Invariante für kontexfreie Sprachen. Theoret. Computer Sci.11, 107–116 (1980)

    Google Scholar 

  7. Hotz, G.: Über die Darstellbarkeit des syntaktischen Monoides kontextfreier Sprachen. R.A.I.R.O. Informatique théorique13, 337–345 (1979)

    Google Scholar 

  8. Lang, S.: Algebra. Addison Wesley 1965

  9. Muller, D.E., Schupp, P.E.: Pushdown automata, graphs, ends, second-order logic, and reachability problems. In: Proc. of the 13th symposium on Theory of Computing, 46–54 (1981)

  10. Sakarovitch, J.: Syntaxe des langages de Chomsky. Th. Sci. Math., Univ. Paris VII, Paris 1979

    Google Scholar 

  11. Senizergues, G.: Décidabilité de l'équivalence des grammaires N.T.S. Thèse 3ème cycle Math., Univ. Paris VII, Paris 1981

    Google Scholar 

  12. Valkema, E.: Einige Zusammenhänge zwischen Halbgruppen und formale Sprachen. Diplomarbeit, Kiel 1970

  13. Valkema, E.: On some relations between formal languages and groups. In: Proc. of “Categorical and Algebraic Methods in Computer Science and System Theory”, Univ. Dortmund, 116–123 (1978)

Download references

Author information

Authors and Affiliations

  1. U.E.R. de Mathématiques, Université de Picardie et L.I.T.P., Paris, France

    Christiane Frougny

  2. L.I.T.P, C.N.R.S, Paris, France

    Jacques Sakarovitch

  3. Institut für Informatik und Praktische Mathematik der Universität Kiel, France

    Erich Valkema

Authors
  1. Christiane Frougny
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jacques Sakarovitch
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Erich Valkema
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Frougny, C., Sakarovitch, J. & Valkema, E. On the Hotz group of a context-free grammar. Acta Informatica 18, 109–115 (1982). https://doi.org/10.1007/BF00625283

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation