Skip to main content
SpringerLink
Log in
Book cover

International Conference on Fundamentals of Computation Theory

FCT 1981: Fundamentals of Computation Theory pp 234–243Cite as

Rational cone and substitution

  • Conference paper
  • First Online:

  • 158 Accesses

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

Abstract

Relations between C(L), the rational cone (full trio) generated by L and subsets of C(L) are given which allow to characterize the languages L which verify the relation :

$$\forall L',C(L)\square C(L') = C(L \uparrow L')$$

Languages satisfying this relation are said substitution complete languages.

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.

Bibliography

  1. J. BEAUQUIER, — A remark about a substitution property (1978). To appear in Math. Syst. Theory.

    Google Scholar 

  2. J. BERSTEL, —“Transductions and context-free languages”, Teubner Verlag, 1978.

    Google Scholar 

  3. L. BOASSON and M. NIVAT, — Sur diverses familles de languages fermées par transductions rationnelles. Acta Informatica, 2 (1973) 180–188.

    Google Scholar 

  4. C.C. ELGOT et J.F. MEZEI, — On relations défined by generalized finite automata. I.B.M. J. Res. Dev. vol 9, (1965) 47–68.

    Google Scholar 

  5. S.A. GREIBACH, — Syntaxtic operators on full semi-AFLS. J. Comp. Syst. Sc. 6 (1972), 30–76.

    Google Scholar 

  6. S.A. GREIBACH, — Erasing in context-free languages. Information and Control, 29, (1975), 301–326.

    Google Scholar 

  7. M. LATTEUX, — Sur les générateurs Algébriques et Linéaires. Acta Informatica 13 (1980), 347–363.

    Google Scholar 

  8. M. LATTEUX, — Quelques propriétés des langages à un compteur, 5 th GI, conference. Lecture Notes in Computer Sciences 104, springer (1981) 52–63.

    Google Scholar 

  9. M. LATTEUX, — A propos du lemme de substitution, Theoretical Computer Science, 14 (1981), 119–123.

    Google Scholar 

  10. J. LEGUY, — Transductions Rationnelles Décroissantes (1979), R.A.I.R.O. Informatique Théorique, Vol. 5, no 2, (1981).

    Google Scholar 

  11. J. LEGUY, — Transductions rationnelles décroissantes et substitution. Thèse 3e cycle, Université de Lille I, Lille 1980.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universite De Lille I Uer Ieea - Informatique, 59655, Villeneuve D'Ascq Cédex, France

    Jeannine Leguy

Authors
  1. Jeannine Leguy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ferenc Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Leguy, J. (1981). Rational cone and substitution. In: Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1981. Lecture Notes in Computer Science, vol 117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10854-8_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-10854-8_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10854-2

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation