On pushdown tree automata

  • Irène Guessarian
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 112)


Input Tree Tree Automaton Tree Language Input Alphabet Tree Transduc 
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. /A/.
    A.V. Aho, Indexed grammars: an extension of the context free case, JACM 15 (1968), 647–671.Google Scholar
  2. /AD/.
    A. Arnold, M. Dauchet, Transductions de forêts reconnaissables monadiques. Forêts corégulières, RAIRO Inf. Théor. 10 (1976), 5–28.Google Scholar
  3. /BD/.
    J. Bilstein, W. Damm, Top-down tree transducers for infinite trees, this Conference.Google Scholar
  4. /B/.
    G. Boudol, Langages algébriques d'arbres, LITP Report, to appear.Google Scholar
  5. /C/.
    B. Courcelle, On jump deterministic pushdown automata, MST 11 (1977), 87–109.Google Scholar
  6. /D/.
    W. Damm, The IO and OI hierarchies, Thesis, Report no41 (1980), RWTH Aachen.Google Scholar
  7. /DG/.
    W. Damm, I. Guessarian, Combining T and n, submitted for publication.Google Scholar
  8. /DO/.
    P. Downey, Formal languages and recursion schemes, Ph. D. Harvard (1974).Google Scholar
  9. /E1/.
    J. Engelfriet, Bottom-up and top-down tree transformations. A comparison. MST 9 (1975), 198–231.Google Scholar
  10. /E2/.
    J. Engelfriet, Some open questions and recent results on tree transducers and tree languages, Proc. Int. Symp. on For. Lang. Theor., Santa Barbara, Academic Press, to appear.Google Scholar
  11. /ES/.
    J. Engelfriet, E.M. Schmidt, IO and OI, JCSS 15 (1977), 328–353, and JCSS 16 (1978), 67–99.Google Scholar
  12. /F/.
    M.J. Fischer, Grammars with macro-like productions, 9th SWAT (1968), 131–142.Google Scholar
  13. /G/.
    J.H. Gallier, Alternate proofs and new results about recursion schemes and DPDA's, Report MS-CIS-80-7, Dpt of Comp. Sc., Univ. of Pennsylvania (1980), to appear.Google Scholar
  14. /GU/.
    I. Guessarian, Algebraic semantics, Lect. Notes in Comp. Sc. no99, Springer-Verlag, Berlin (1981).Google Scholar
  15. /N/.
    M. Nivat, On the interpretation of recursive polyadic program schemes, Symp. Mat. 15, Rome (1975), 255–281.Google Scholar
  16. /P/.
    N. Polian, Langages infinis engendrés par les grammaires algébriques d'arbres, Th. 3ème Cycle, in preparation, Poitiers (1981).Google Scholar
  17. /RA/.
    M. Rabin, Automata on infinite objects and Church's problem, CBSM regional Conf. series in Math. no13, AMS (1969).Google Scholar
  18. /R/.
    W.C. Rounds, Mappings and grammars on trees, MST 4 (1970), 257–287.Google Scholar
  19. /S/.
    J.M. Steyaert, Lemmes d'itération pour les familles d'arbres, Actes du Séminaire d'Inf. Théor. 1977–1978, LITP Report, Paris (1979).Google Scholar
  20. /T/.
    J.W. Thatcher, Tree automata: an informal survey, in Currents in Theory of Comp., Aho (ed.), Prentice-Hall, London (1973).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Irène Guessarian
    • 1
  1. 1.LITP CNRS — UER de MathématiquesUniversité Paris 7 - T 55 56 1er Et.Paris Cédex05

Personalised recommendations