Advertisement

Categorical theory of tree processing

  • Suad Alagić
Submitted Abstract
Part of the Lecture Notes in Computer Science book series (LNCS, volume 25)

Keywords

Natural Transformation Input Process Finite Automaton State Transformation Sequential Machine 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    S. Alagić, Natural State Transformations, COINS Technical Report 73B-2, University of Massachusetts at Amherst, 1973.Google Scholar
  2. [2]
    M. A. Arbib and E. G. Manes, Machines in a Category, SIAM Review, April, 1974.Google Scholar
  3. [3]
    M. A. Arbib and E. G. Manes, The Monoid of a Machine in a Category, to appear.Google Scholar
  4. [4]
    M. A. Arbib and E. G. Manes, Adjoint Machines, State Behaviour Machines, and Duality, Technical Report '73B-1, February, 1973, Computer and Information Science, University of Massachusetts, Amherst; to appear in J. Pure Appl. Alg.Google Scholar
  5. [5]
    M. A. Arbib and E. G. Manes, Kleisli Machines, to appear.Google Scholar
  6. [6]
    B. S. Baker, Tree Transductions and Families of Tree Languages, Proceedings of Fifth Annual ACM symposium on theory of computing, May., 1973.Google Scholar
  7. [7]
    M. Barr, Coequalizers and Free Triples, Math. Z., 116 (1970), 307–322.CrossRefMathSciNetGoogle Scholar
  8. [8]
    J. Beck, Distributive Laws, Lecture Notes in Mathematics, Vol. 80, Springer-Verlag.Google Scholar
  9. [9]
    E. J. Dubuc, Kan Extensions in Enriched Category Theory, Lecture Notes in Mathematics, Vol. 145, Springer-Verlag, 1970.Google Scholar
  10. [10]
    J. Engelfriet, Bottomup and Topdown Treetransformations: A Comparison, Memorandum No. 19, July, 1971, Techniche Hogeschool Twente, Netherlands.Google Scholar
  11. [11]
    S. Eilenberg and J. B. Wright, Automata in General Algebras, Information and Control, 11 (1967).Google Scholar
  12. [12]
    S. Ginsburg, The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York, 1966.MATHGoogle Scholar
  13. [13]
    G. Grätzer, Universal Algebra, D. Van Nostrand, Princeton, 1968.Google Scholar
  14. [14]
    H. Kleisli, Every Standard Construction is Induced by a Pair of Adjoint Functors, Proc. Am. Math. Society, 16 (1965).Google Scholar
  15. [15]
    S. Mac Lane, Categories for the Working Mathematician, Springer-Verlag, 1972.Google Scholar
  16. [16]
    E. G. Manes, A Triple Miscellany: Some Aspects of the Theory of Algebras Over a Triple, Thesis, Wesleyan University, 1967.Google Scholar
  17. [17]
    E. G. Manes, Algebraic Theories, Springer-Verlag, to appear.Google Scholar
  18. [18]
    J. P. Meyer, Induced Functors on Categories of Algebras, The John Hopkins University, Baltimore, 1972, preprint.Google Scholar
  19. [19]
    J. Mezei and J. B. Wright, Generalized Algol-Like Languages, Information and Control, 11 (1967).Google Scholar
  20. [20]
    W. C. Rounds, Mappings and Grammars on Trees, Mathematical System Theory, 4 (1970).Google Scholar
  21. [21]
    J. W. Thatcher, Characterizing Derivation Trees of Context-Free Grammars Through a Generalization of Finite Automata Theory, Journal of Computer and System Sciences, 1 (1967).Google Scholar
  22. [22]
    J. W. Thatcher, Generalized 2 Sequential Machine Maps, Journal of Computer and System Sciences, 4 (1970).Google Scholar
  23. [23]
    J. W. Thatcher, There's a Lot More to Finite Automata Theory Than You Would Have Thought, RC 2852, 1970, IBM, Yorktown Heights.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • Suad Alagić
    • 1
  1. 1.Computer and Information ScienceUniversity of MassachusettsAmherst

Personalised recommendations