Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V. and Ullman, J.D., Translations on a Context Free Grammar, Info. and Control 19(1971), 439–475.
Buttlemann, H.W., On the Syntactic Structure of Unrestricted Grammars, I and II, Info. and Control 29(1975), 29–101.
Engelfriet, J., Bottom-up and Top-down Tree Transformations — a comparison, Math. Syst. Th. 9(1975), 193–231.
Engelfriet, J., Tree Automata and Tree Grammars, Lecture Notes DAIMI, FN-10, University of Aarhus, Denmark, 1975.
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.
Hart, J.M., Acceptors for the Derivation Languages of Phrase-Structure Grammars, Info. and Control 25(1974), 75–92.
Hopcroft, J.E. and Ullman, J.D., Nonerasing Stack Automata, JCSS 1(1967), 166–186.
Hopcroft, J.E. and Ullman, J.D., Formal Languages and their Relation to Automata, Addison-Wesley, Reading, Mass., 1969.
Kamimura, T., Automata on Directed Acyclic Graphs, Ph.D. dissertation, in preparation.
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.
Levy, L.S. and Joshi, A.K., Some Results in Tree Automata, Math. Syst. Th. 6(1972), 336–342.
Ogden, W.F. and Rounds, W.C., Composition of n Tree Transducers, Proc. 4th Annual ACM STOC, Denver, CO, 1972, 198–206.
Shepherdson, J.C., The Reduction of Two-way Automata to One-way Automata, IBM J. Res. Devel. 3(1959), 198–200.
Thatcher, J.W., Characterizing Derivation Trees of Context-Free Grammars through a Generalization of Finite Automata Theory, JCSS 1(1967), 317–322.
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.
Wilson, R., Introduction to Graph Theory, Oliver and Boyd, Edinburgh, 1972.
Author information
Authors and Affiliations
Editor information
Rights 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