Skip to main content
SpringerLink
Log in

Parallel and two-way recognizers of directed acyclic graphs

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

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

  • 141 Accesses

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. Aho, A.V. and Ullman, J.D., Translations on a Context Free Grammar, Info. and Control 19(1971), 439–475.

    Article  Google Scholar 

  2. Buttlemann, H.W., On the Syntactic Structure of Unrestricted Grammars, I and II, Info. and Control 29(1975), 29–101.

    Google Scholar 

  3. Engelfriet, J., Bottom-up and Top-down Tree Transformations — a comparison, Math. Syst. Th. 9(1975), 193–231.

    Article  Google Scholar 

  4. Engelfriet, J., Tree Automata and Tree Grammars, Lecture Notes DAIMI, FN-10, University of Aarhus, Denmark, 1975.

    Google Scholar 

  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. Hart, J.M., Acceptors for the Derivation Languages of Phrase-Structure Grammars, Info. and Control 25(1974), 75–92.

    Article  Google Scholar 

  7. Hopcroft, J.E. and Ullman, J.D., Nonerasing Stack Automata, JCSS 1(1967), 166–186.

    Google Scholar 

  8. Hopcroft, J.E. and Ullman, J.D., Formal Languages and their Relation to Automata, Addison-Wesley, Reading, Mass., 1969.

    Google Scholar 

  9. Kamimura, T., Automata on Directed Acyclic Graphs, Ph.D. dissertation, in preparation.

    Google Scholar 

  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. Levy, L.S. and Joshi, A.K., Some Results in Tree Automata, Math. Syst. Th. 6(1972), 336–342.

    Google Scholar 

  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. Shepherdson, J.C., The Reduction of Two-way Automata to One-way Automata, IBM J. Res. Devel. 3(1959), 198–200.

    Google Scholar 

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

    Article  Google Scholar 

  16. Wilson, R., Introduction to Graph Theory, Oliver and Boyd, Edinburgh, 1972.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer & Information Sciences, University of Delaware, 19711, Newark, Delaware

    Tsutomu Kamimura & Giora Slutzki

Authors
  1. Tsutomu Kamimura
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giora Slutzki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jiří Bečvář

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kamimura, T., Slutzki, G. (1979). Parallel and two-way recognizers of directed acyclic graphs. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1979. MFCS 1979. Lecture Notes in Computer Science, vol 74. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09526-8_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-09526-8_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09526-2

  • Online ISBN: 978-3-540-35088-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation