Parallel and two-way recognizers of directed acyclic graphs

  • Tsutomu Kamimura
  • Giora Slutzki
Part of the Lecture Notes in Computer Science book series (LNCS, volume 74)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aho, A.V. and Ullman, J.D., Translations on a Context Free Grammar, Info. and Control 19(1971), 439–475.CrossRefGoogle Scholar
  2. 2.
    Buttlemann, H.W., On the Syntactic Structure of Unrestricted Grammars, I and II, Info. and Control 29(1975), 29–101.Google Scholar
  3. 3.
    Engelfriet, J., Bottom-up and Top-down Tree Transformations — a comparison, Math. Syst. Th. 9(1975), 193–231.CrossRefGoogle Scholar
  4. 4.
    Engelfriet, J., Tree Automata and Tree Grammars, Lecture Notes DAIMI, FN-10, University of Aarhus, Denmark, 1975.Google Scholar
  5. 5.
    Engelfriet, J., Rozenberg, G. and Slutzki, G., Tree Transducers, L-systems and Two-way Machines, Proc. 10-th Annual ACM STOC, San Diego, CA, 1978, 66–74.Google Scholar
  6. 6.
    Hart, J.M., Acceptors for the Derivation Languages of Phrase-Structure Grammars, Info. and Control 25(1974), 75–92.CrossRefGoogle Scholar
  7. 7.
    Hopcroft, J.E. and Ullman, J.D., Nonerasing Stack Automata, JCSS 1(1967), 166–186.Google Scholar
  8. 8.
    Hopcroft, J.E. and Ullman, J.D., Formal Languages and their Relation to Automata, Addison-Wesley, Reading, Mass., 1969.Google Scholar
  9. 9.
    Kamimura, T., Automata on Directed Acyclic Graphs, Ph.D. dissertation, in preparation.Google Scholar
  10. 10.
    Kamimura, T. and Slutzki, G., DAGs and Chomsky Hierarchy, to appear in Proc. of 6th Coll. of EATCS on Automata, Languages and Programming, July 1979, Graz, Austria.Google Scholar
  11. 11.
    Levy, L.S. and Joshi, A.K., Some Results in Tree Automata, Math. Syst. Th. 6(1972), 336–342.Google Scholar
  12. 12.
    Ogden, W.F. and Rounds, W.C., Composition of n Tree Transducers, Proc. 4th Annual ACM STOC, Denver, CO, 1972, 198–206.Google Scholar
  13. 13.
    Shepherdson, J.C., The Reduction of Two-way Automata to One-way Automata, IBM J. Res. Devel. 3(1959), 198–200.Google Scholar
  14. 14.
    Thatcher, J.W., Characterizing Derivation Trees of Context-Free Grammars through a Generalization of Finite Automata Theory, JCSS 1(1967), 317–322.Google Scholar
  15. 15.
    Thatcher, J.W. and Wright, J.B., Generalized Finite Automata Theory with an Application to a Decision-Problem of Second Order Logic, Math. Syst. Th. 2(1968), 57–81.CrossRefGoogle Scholar
  16. 16.
    Wilson, R., Introduction to Graph Theory, Oliver and Boyd, Edinburgh, 1972.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • Tsutomu Kamimura
    • 1
  • Giora Slutzki
    • 1
  1. 1.Department of Computer & Information SciencesUniversity of DelawareNewark

Personalised recommendations