Advertisement

Sur deux langages linéaires

  • M. Latteux
Vorträge (In Alphabetischer Reihenfolge)
Part of the Lecture Notes in Computer Science book series (LNCS, volume 67)

Abstract

First, we prove that if the language Sym = {w wR/w ε {a,b}*} belongs to Fσ(L), the smallest substitution closed full AFL generated by the family L, then there exists a language L ε L such that Sym ε C(L). We prove that this property does not hold for C1={anbn/n ≥0 }, by characterizing the languages \(L \subseteq C_1 \) such that C1 ε C(L).

Keywords

Nous Allons Nous Pouvons Small Substitution Nous Montrons Simple Syntactic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Références

  1. 1.
    J.M. Autebert, J. Beauquier et L. Boasson, "Contribution à l'étude des cônes minimaux", C.R. Acad. Sc. 287 (1978), 353–355.Google Scholar
  2. 2.
    J. Beauquier, "Substitutions de langages linéaires et à compteur", 1978, soumis à J. Comp. Syst. Sc..Google Scholar
  3. 3.
    J. Berstel, "Transductions and Context-free languages", Teubner Verlag, 1979.Google Scholar
  4. 4.
    J. Berstel et L. Boasson, "Une suite décroissante de cônes rationnels", in Loeckx (Ed.), Automata, languages and programming, 2nd Colloquium, Saarbrücken, Springer Verlag (1974), 383–397.Google Scholar
  5. 5.
    J.L. Durieux, "Sur l'image, par une transduction rationnelle, des mots sur une lettre", RAIRO Informatique Théorique (1975), 25–37.Google Scholar
  6. 6.
    S. Ginsburg et E.H. Spanier, "On incomparable abstract families of languages (AFL)", J. Comp. Syst. Sc. 9 (1974), 88–108.Google Scholar
  7. 7.
    J. Goldstine, "Substitution and bounded languages", J. Comp. Syst. Sc. 6 (1972), 9–29.Google Scholar
  8. 8.
    J. Goldstine, "Bounded AFL's", J. Comp. Syst. Sc. 12 (1976), 399–419.Google Scholar
  9. 9.
    S. Greibach, "Chains of full AFL's", Math. Syst. Theory 4 (1970), 231–242.CrossRefGoogle Scholar
  10. 10.
    S. Greibach, "Simple Syntactic Operators on full semi-AFL's", J. Comp. Syst. Sc. 6 (1972), 30–76.Google Scholar
  11. 11.
    M. Latteux, "Cônes rationnels commutativement clos", RAIRO Informatique Théorique 11 (1977), 29–51.Google Scholar
  12. 12.
    M. Latteux, "Cônes rationnels commutatifs", 1977, à paraître dans J. Comp. Syst. Sc. Google Scholar
  13. 13.
    M. Latteux, "Languages commutatifs", Thèse de Doctorat d'Etat, Université de Lille I, 1978.Google Scholar
  14. 14.
    M. Nivat, "Transductions des languages de Chomsky", Annales de l'Institut Fourier 18 (1968), 339–456.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • M. Latteux

There are no affiliations available

Personalised recommendations