Abstract
“Leaf-size” (or “branching”) is the minimum number of leaves of some accepting computation tree of alternating devices. For example, one leaf corresponds to nondeterministic computation. In this paper, we investigate the effect of constant leaves of two-dimensional alternating Turing machines, and show the following facts: (1) For any function L(m, n), k leaf- and L(m, n) space-bonnded two-dimensional alternating Turing machines which have only universal states are equivalent to the same space bounded determinisitic Turing machines for any integer k≥1, where m (n) is the number of rows (columns) of the rectangular input tapes. (2) For square input tapes, k+1 leaf- and o(log m) space-bounded two-dimensional alternating Turing machines are more powerful than k leaf-bounded ones for each k≥1. (3) The necessary and sufficient space for three-way deterministic Turing machines to simulate k leaf-bounded two-dimensional alternating finite automata is n k+1, where we restrict the space function of three-way deterministic Turing machines to depend only on the number of columns of the given input tapes.
Keywords
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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
W.L.Ruzzo, Tree-size bounded alternation, J. Comp. Sys. Sci. 21, pp.218–235 (1980).
K.N.King, Measures of parallelism in alternating computation trees, Proc. 13th ACM Symp. on Theory of Comp., pp.189–201 (1981).
K.Inoue, I.Takanami,and H.Taniguchi, Two-dimen-sional alternating Turing machines, Theoret. Comput. Sci. 27, pp.61–83 (1983).
H.Yamamoto, Leaf reduction theorem on time-and leaf-bounded alternating Turing machines, IEICE Trans. Inf. & Syst. E75-D, No.1, pp.133–140 (Jan. 1992).
H.Matsuno, K.Inoue, I.Takanami, and H.Taniguchi, Alternating simple multi-head automata, Theoret. Comput. Sci. 36, No.2–3, pp.291–308 (Mar.1985).
J.Hromkovic,K.Inoue,and I.Takanami, Lower bounds for language recognition on two-dimen-sional alternating multihead machines, to appear in J. Comp. Sys. Sci.
A.Ito, K.Inoue, I.Takanami, and H.Taniguchi, Two-dimensional alternating Turing machines with only universal states, Inform. and Control 55, pp.193–221 (1983).
K.Morita, H.Umeo, and K.Sugata, Accepting Abilities of Offside-free Two-dimensional Marker Automata — The simulation of Four-way Automata by Three-way Tape-bounded Turing Machines, The Technical Reports of the Institute of Electronics and Communication Engineers of Japan Vol. AL79, No.19, pp.1–10(1979).
K.Inoue and I.Takanami, A Note on Deterministic Three-Way Tape-Bounded Two-Dimen-sional Turing Machines, Information Sciences 20, pp.41–55 (1980).
A.Ito, K.Inoue,and I.Takanami, The simulation of two-dimensional one-marker automata by three-way Turing machines, Inter. J. of Patt. Recog. & Art. Intel. 3, No. 3&4, pp.393–404 (1989).
A.Rosenfeld, Picture Languages — Formal models for Picture Recognition, Academic Press (1979).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ito, A., Inoue, K., Takanami, I., Inagaki, Y. (1992). Constant leaf-size hierarchy of two-dimensional alternating turing machines. In: Nakamura, A., Nivat, M., Saoudi, A., Wang, P.S.P., Inoue, K. (eds) Parallel Image Analysis. ICPIA 1992. Lecture Notes in Computer Science, vol 654. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56346-6_36
Download citation
DOI: https://doi.org/10.1007/3-540-56346-6_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56346-4
Online ISBN: 978-3-540-47538-5
eBook Packages: Springer Book Archive