Rational relations of binary trees

  • Masako Takahashi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 52)


  1. Arnold, A & M. Dauchet [1976] Bi-transductions de forets, "Automata, Languages and Programming" (edited by S. Michaelson & R. Milner), Edinburgh University Press, 74–86.Google Scholar
  2. Eilenberg, S. [1974] "Automata, Languages, and Machines," Vol. A, Academic Press.Google Scholar
  3. Elgot, C.C. & J.E. Mezei [1965] On relations defined by generalized finite automata, IBM J. Res. Develop. 9, 47–68.Google Scholar
  4. Engelfriet, J. [1975] Bottom-up and top-down tree transformations—a comparison, Math. Systems Theory 9, 198–231.Google Scholar
  5. Ginsburg, S. & S.A. Greibach [1969] Abstract families of languages, Memoirs of AMS, no. 87, 1–32.Google Scholar
  6. Knuth,D.E. [1968] "The Art of Computer Programming," Vol.1, Addison Wesly.Google Scholar
  7. Nivat, M. [1968] Transductions des langages de Chomsky, Annales de l'Institut Fourier 18, 339–456.Google Scholar
  8. Takahashi, M. [1975] Generalizations of regular sets and their application to a study of context-free languages, Information and Control 27, 1–36.Google Scholar
  9. Thatcher, J.W. & J.B. Wright [1968] Generalized finite automata theory with an application to a decision problem of second-order logic, Math. Systems Theory 2, 57–81.Google Scholar
  10. Thatcher,J.W. [1969] Generalized2 sequential machine maps, IBM Res. Report RC2466.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Masako Takahashi
    • 1
  1. 1.Tokyo Institute of TechnologyJapan

Personalised recommendations