Skip to main content
SpringerLink
Log in

Combining T and level-N

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1981 (MFCS 1981)

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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 appear

    Google Scholar 

  2. 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 Verlag

    Google Scholar 

  3. DAMM, W. The IO-and OI-hierarchies, Schriften zur Informatik und Angewandten Mathematik 41 (1980), RWTH Aachen, submitted for publication

    Google Scholar 

  4. DAMM, W. Top-down tree-transducers for infinite trees, in preparation

    Google Scholar 

  5. DAMM, W. / GOERDT,A. Level-n PDA's, in preparation

    Google Scholar 

  6. DAMM, W. / GUESSARIAN, I. Combining T and level-N LITP-report 81-11, University Paris VII, (1981)

    Google Scholar 

  7. ENGELFRIET, J. Tree automata and tree grammars, Datalogisk Afdelning report, DAIMI FN-10, Aarhus University (1975)

    Google Scholar 

  8. ENGELFRIET, J. Three hierarchies of transducers, Memorandum 217 (1978), Twente University of Technology

    Google Scholar 

  9. ENGELFRIET, J. Some open questions and recent results on tree transducers and tree languages, Proc. Symposium on Formal Language Theory, Academic Press (1980), to appear

    Google Scholar 

  10. ENGELFRIET, J. / SCHMIDT, E.M. IO and OI, JCSS Vol. 15, 3 (1977), 328–353 and Vol. 16, 1 (1978), 67–99

    Google Scholar 

  11. 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 appear

    Google Scholar 

  12. MASLOV, A.N. Multilevel stack automata, Problemy Peredachi Informatsii Vol. 12, 1 (1976), 55–62

    Google Scholar 

  13. VOGLER, H. Berechnungsmodelle syntaxgesteuerter Übersetzungen, Diplomarbeit, RWTH Aachen (1981),to appear

    Google Scholar 

  14. WAND, M. An algebraic formulation of the Chomsky-Hierarchy Category Theory Applied to Computation and Control, Lecture Notes in Computer Science 25 (1975), 209–213

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl für Informatik II RWTH, Aachen

    W. Damm

  2. LITP, UER de Mathématiques, Université Paris VII, France

    I. Guessarian

Authors
  1. W. Damm
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. Guessarian
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska Michal Chytil

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Damm, W., Guessarian, I. (1981). Combining T and level-N. In: Gruska, J., Chytil, M. (eds) Mathematical Foundations of Computer Science 1981. MFCS 1981. Lecture Notes in Computer Science, vol 118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10856-4_92

Download citation

  • DOI: https://doi.org/10.1007/3-540-10856-4_92

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10856-6

  • Online ISBN: 978-3-540-38769-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation