Advertisement

Combining T and level-N

  • W. Damm
  • I. Guessarian
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 118)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BD]
    BILSTEIN, J. / DAMM, W. Top-down tree-transducers for infinite trees I, Proc. 6 ième colloque sur les Arbres en Algébre et en Programmation, Lecture Notes in Computer Science (1981), to appearGoogle Scholar
  2. [Da 1]
    DAMM, W. An algebraic extension of the Chomsky-Hierarchy, Proc. conf. on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 74 (1979), 266–276, Springer VerlagGoogle Scholar
  3. [Da 2]
    DAMM, W. The IO-and OI-hierarchies, Schriften zur Informatik und Angewandten Mathematik 41 (1980), RWTH Aachen, submitted for publicationGoogle Scholar
  4. [Da 3]
    DAMM, W. Top-down tree-transducers for infinite trees, in preparationGoogle Scholar
  5. [DG]
    DAMM, W. / GOERDT,A. Level-n PDA's, in preparationGoogle Scholar
  6. [DGu]
    DAMM, W. / GUESSARIAN, I. Combining T and level-N LITP-report 81-11, University Paris VII, (1981)Google Scholar
  7. [Eng 1]
    ENGELFRIET, J. Tree automata and tree grammars, Datalogisk Afdelning report, DAIMI FN-10, Aarhus University (1975)Google Scholar
  8. [Eng 2]
    ENGELFRIET, J. Three hierarchies of transducers, Memorandum 217 (1978), Twente University of TechnologyGoogle Scholar
  9. [Eng 3]
    ENGELFRIET, J. Some open questions and recent results on tree transducers and tree languages, Proc. Symposium on Formal Language Theory, Academic Press (1980), to appearGoogle Scholar
  10. [ES]
    ENGELFRIET, J. / SCHMIDT, E.M. IO and OI, JCSS Vol. 15, 3 (1977), 328–353 and Vol. 16, 1 (1978), 67–99Google Scholar
  11. [Gue]
    GUESSARIAN, I. On pushdown tree automata, Proc. 6 ième colloque sur les Arbres en Algébre et en Programmation, Lecture Notes in Computer Science (1981), to appearGoogle Scholar
  12. [Mas]
    MASLOV, A.N. Multilevel stack automata, Problemy Peredachi Informatsii Vol. 12, 1 (1976), 55–62Google Scholar
  13. [Vog]
    VOGLER, H. Berechnungsmodelle syntaxgesteuerter Übersetzungen, Diplomarbeit, RWTH Aachen (1981),to appearGoogle Scholar
  14. [Wa]
    WAND, M. An algebraic formulation of the Chomsky-Hierarchy Category Theory Applied to Computation and Control, Lecture Notes in Computer Science 25 (1975), 209–213Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • W. Damm
    • 1
  • I. Guessarian
    • 2
  1. 1.Lehrstuhl für Informatik II RWTHAachen
  2. 2.LITP, UER de MathématiquesUniversité Paris VIIFrance

Personalised recommendations