Skip to main content
SpringerLink
Log in

A remark about a substitution property

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

S. A. Greibach proved in “Chains of full AFL's” a useful property concerning the substitution of full semi-AFL's. We prove here that this property remains true when the families of languages under considerations are assumed only to be full trios, i.e., closure under union is not required.

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. J. Berstel. (1979) Transductions and context free languages, Teubner Verlag (1979).

  2. S. Ginsburg. Algebraic and automata-theoretic properties of formal languages. North Holland Publishing Company, (1975).

  3. S. A. Greibach. Chains of full AFLs,Mathematical Systems Theory 4, 231–242 (1970).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire Informatique Théorique et Programmation and Institut d'Informatique de L'Université de Picardie, Université de Picardie, U.E.R. de Mathématiques, 33, Rue St. Leu, 80039, Amiens, France

    Joffroy Beauquier

Authors
  1. Joffroy Beauquier
    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

Beauquier, J. A remark about a substitution property. Math. Systems Theory 14, 189–191 (1981). https://doi.org/10.1007/BF01752395

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation