Theoreme de transversale rationnelle pour les automates a pile deterministes

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


Context Free Language Rational Subset Combinatorial Group Theory Pushdown Store Condition Suivante 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    M. Benois — Parties rationnelles du groupe libre, C.R. Acad. Sci. Paris A. 269, 1969, 1188–1190.Google Scholar
  2. [2]
    J. Berstel — Transductions and context free languages, Teubner, 1978.Google Scholar
  3. [3]
    C. Choffrut — Contribution à l'étude de quelques familles remarquables de fonctions rationnelles, Thèse Sci. Math., Univ. Paris VII, Paris, 1978.Google Scholar
  4. [4]
    S. Eilenberg — Automata, Languages, and Machines, Vol. A, Academic Press, 1974.Google Scholar
  5. [5]
    M. Fliess — Deux applications de la représentation matricielle d'une série rationnelle non commutative, J. of Algebra 19, 1971, 344–353.CrossRefGoogle Scholar
  6. [6]
    S. Ginsburg and S. Greibach—Deterministic context free languages, Inform. and Control 9, 1966, 620–648.Google Scholar
  7. [7]
    W. Magnus, D. Karass, and S. Solitar — Combinatorial Group Theory, J. Wiley, 1966.Google Scholar
  8. [8]
    M. Nivat — Transductions des langages de Chomsky, Ann. Inst. Fourier 18, 1968, 339–445.Google Scholar
  9. [9]
    M. Nivat — Sur les automates à mémoire pile, in Proceedings of International Computing Symposium 70 (W. Itzfeld edt.), 1973, 655–663.Google Scholar
  10. [10]
    M. Nivat et J-F. Perrot — Une généralisation du monoïde bicyclique, C.R. Acad. Sci. Paris A 270, 1970, 221–228.Google Scholar
  11. [11]
    W. Ogden — Intercalation theorems for pushdown store and stack languages, Ph. D. Thesis, Standford, 1968.Google Scholar
  12. [12]
    J. Sakarovitch — On the recognition of languages by pushdown automata, to appear.Google Scholar
  13. [13]
    E. Shamir — A representation theorem for algebraic and context-free power series in non commuting variables, Inform. and Control 11, 1967, 239–254.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • Jacques Sakarovitch

There are no affiliations available

Personalised recommendations