Skip to main content
SpringerLink
Log in

Mappings and grammars on trees

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. A. V. Aho, Indexed grammars—an extension of the context-free grammars,J. Assoc. Comput. Mach. 15 (1968), 647–671.

    Google Scholar 

  2. A. V. Aho andJ. D. Ullman, Automaton analogs of syntax-directed translation schemata,Proc. 9th IEEE Ann. Symp. on Switching and Automata Theory, October, 1968.

  3. A. V. Aho andJ. D. Ullman, Translations on a context-free grammar,Proc. Assoc. Comput. Mach. Symp. on Theory of Computing, May, 1969.

  4. M. A. Arbib andY. Give'on, Algebra automata I: Parallel programming as a prolegomena to the categorical approach,Information and Control 12 (1968), 331–345.

    Google Scholar 

  5. W. S. Brainerd, The minimalization of tree automata,Information and Control 13 (1968), 484–491.

    Google Scholar 

  6. W. S. Brainerd, Tree generating regular systems,Information and Control 14 (1969), 217–231.

    Google Scholar 

  7. N. Chomsky,Aspects of the Theory of Syntax, M.I.T. Press, Cambridge, Mass., 1965.

    Google Scholar 

  8. J. E. Doner, Tree acceptors and some of their applications, System Development Corp., Scientific Report No. 8 (1967).

  9. M. J. Fischer, Grammars with macro-like productions,Proc. 9th IEEE Symp. on Switching and Automata Theory, October, 1968.

  10. E. T. Irons, A syntax-directed compiler for ALGOL 60,Comm. ACM 4 (1961), 51–55.

    Google Scholar 

  11. P. M. Lewis andR. E. Stearns, Syntax-directed transduction,J. Assoc. Comput. Mach. 15 (1968), 465–488.

    Google Scholar 

  12. J. Mezei andJ. B. Wright, Algebraic automata and context-free sets,Information and Control 11 (1967), 3–29.

    Google Scholar 

  13. M. O. Rabin, Mathematical Theory of Automata,Mathematical Aspects of Computer Science, Proc. Symposia Appl. Math., XIX, 173–175, American Mathematical Society, Providence, R.I., 1967.

  14. W. C. Rounds, Trees, transducers, and transformations, Dissertation, Stanford University, August, 1968.

  15. J. W. Thatcher, Characterizing derivation trees of context-free grammars through a generalization of finite automata theory,J. Comput. System Sci. 1 (1967), 317–322.

    Google Scholar 

  16. J. W. Thatcher, Transformations and translations from the point of view of generalized finite automata theory,Proc. Assoc. Comput. Mach. Conference on Theory of Computing, May, 1969.

  17. J. W. Thatcher andJ. B. Wright, Generalized finite automata theory with an application to a decision problem of second-order logic,Math. Systems Theory 2 (1968), 57–81.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Case Western Reserve University, USA

    William C. Rounds

Authors
  1. William C. Rounds
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

A preliminary version of this work appeared in theProceedings of the ACM Symposium on the Theory of Computing, Marina del Rey, California, May 1969.

Some of these results were obtained in the author's doctoral dissertation, supported by USAF Contract F 44 620—68—C—0030.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rounds, W.C. Mappings and grammars on trees. Math. Systems Theory 4, 257–287 (1970). https://doi.org/10.1007/BF01695769

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01695769

Keywords

Search

Navigation