Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Tokio OKAZAKI"'
Publikováno v:
Information Sciences. 162:295-314
This paper investigates a relationship among the accepting powers of deterministic, nondeterministic, and alternating one-pebble two-dimensional Turing machines, and shows that (i) nondeterminism are more powerful than determinism for o(log n) space-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6ce492eb7b53fcb3a3e41434f6345346
https://doi.org/10.1016/j.ins.2003.09.012
https://doi.org/10.1016/j.ins.2003.09.012
Publikováno v:
Information Sciences. 146:151-170
This paper investigates non-closure properties of the classes of sets accepted by space-bounded two-dimensional alternating Turing machines and three-way two-dimensional alternating Turing machines. Let 2-ATM(L(m, n)) (resp., TR2-ATM(L(m, n))) be the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cd70c480acb38ff25f79cfa258a77d66
https://doi.org/10.1016/s0020-0255(02)00186-x
https://doi.org/10.1016/s0020-0255(02)00186-x
Publikováno v:
International Journal of Pattern Recognition and Artificial Intelligence. 15:1143-1165
This paper investigates closure property of the classes of sets accepted by space-bounded two-dimensional alternating Turing machines (2-atm's) and space-bounded two-dimensional alternating pushdown automata (2-apda's), and space-bounded two-dimensio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9a049fc70c3e731b7e5412ab1ea21bc8
https://doi.org/10.1142/s0218001401001398
https://doi.org/10.1142/s0218001401001398
Publikováno v:
International Journal of Pattern Recognition and Artificial Intelligence. 14:477-500
This paper introduces a three-way two-dimensional probabilistic Turing machine (tr2-ptm), and investigates several properties of the machine. The tr2-ptm is a two-dimensional probabilistic Turing machine (2-ptm) whose input head can only move left, r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3113609bad1e8b538c7c5119d8f12d1d
https://doi.org/10.1142/s0218001400000313
https://doi.org/10.1142/s0218001400000313
Publikováno v:
Information Processing Letters. 72:19-24
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1361938a38998b7b6f6059fe050328e6
https://doi.org/10.1016/s0020-0190(99)00127-1
https://doi.org/10.1016/s0020-0190(99)00127-1
Publikováno v:
International Journal of Pattern Recognition and Artificial Intelligence. 13:503-521
This paper investigates the space hierarchies of the language classes for two-dimensional Turing machines (2-TM's), two-dimensional pushdown automata (2-PDA's) and two-dimensional counter automata (2-CA's) with small space. We show that (1) if L(n) i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::290dfdf95a5abb5fd9e8c422cc773d41
https://doi.org/10.1142/s0218001499000306
https://doi.org/10.1142/s0218001499000306
Publikováno v:
Information Sciences. 115:61-81
This paper investigates closure properties of the classes of sets recognized by spacebounded two-dimensional probabilistic Turing machines with error probability less than 12. Let 2-PTM(L(m,n)) be the class of sets recognized by L(m,n) space-bounded
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8c394fafb29ac7d5b48f3f905ce85db8
https://doi.org/10.1016/s0020-0255(98)10084-1
https://doi.org/10.1016/s0020-0255(98)10084-1
Publikováno v:
Information Sciences. 113:205-220
This paper introduces two-dimensional probabilistic Turing machines (2-ptm's), and investigates several properties of them. We first investigate a relationship between two-dimensional alternating finite automata (2-afa's) and 2-ptm's with error proba
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5a2f1672df83cc84bad8e29dde101a3c
https://doi.org/10.1016/s0020-0255(98)10049-x
https://doi.org/10.1016/s0020-0255(98)10049-x
Publikováno v:
Algorithms and Computation ISBN: 9783540206958
ISAAC
ISAAC
This paper investigates some aspects of the accepting powers of deterministic, nondeterministic, and alternating one-pebble Turing machines with spaces between log log n ang log n. We first investigate a relationship between the accepting powers of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::41aed202124a5cdaa0ce2014307500aa
https://doi.org/10.1007/978-3-540-24587-2_65
https://doi.org/10.1007/978-3-540-24587-2_65
Autor:
Naoji Kitamura, Fumihiko Jitsunari, Tokio Okazaki, Masana Ogata, Shoichiro Kanno, Hisashi Hagaya, Wakahiko Fujiwara, Yutaka Nagao, Kinichi Tanaka
Publikováno v:
Okayama Igakkai Zasshi (Journal of Okayama Medical Association). 82:9-18
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::19b629068d413470fc6aee2e7702cf79
https://doi.org/10.4044/joma1947.82.1-2supplement_9
https://doi.org/10.4044/joma1947.82.1-2supplement_9