ALTERNATION FOR TWO-WAY (INKDOT) MULTI-COUNTER AUTOMATA WITH SUBLINEAR SPACE
スポンサーリンク
概要
- 論文の詳細を見る
本論文では, 線型以下の空間量をもつ交代性マルチカウンタオートマタに関する交代の階層性, 及び線型以下の空間量をもつ2方向1インクドット交代性マルチカウンタオートマタに関する基本的ないくつかの性質について考察している。初めに, 線型以下の空間量に制限された交代性マルチカウンタオートマタは, 無限の交代階層性を有することを示す。次に, 線型以下の空間量の交代性マルチカウンタオートマタにおいて, 1インクドットをもつ場合とそうでない場合との受理能力の関係について考察する。例えば, 各l⊇1 (l⊇1 (l≠3))に対し, 任意の入力上の任意の計算路において, 全称状態(存在状態)から始まり, 高々l-1回の交代を行う2方向交代性マルチカウンタオートマタに関しては, 1インクドットをもつ場合の方が, もたない場合よりも真に受理能力が高いことなどを証明する。
- 山口大学工学部の論文
著者
-
INOUE Katsushi
Department of Computer Science and Systems Engineering, Faculty of Engineering, Yamaguchi University
-
Inoue Katsushi
Department Of Computer Science And Systems Engineering Faculty Of Engineering Yamaguchi University
-
Inoue K
Department Of Computer Science And Systems Engineering Faculty Of Engineering Yamaguchi University
-
Xu Jianliang
Department Of Computer Science Ocean University Of China
-
Yoshinaga Tsunehiro
Department Of Computer Science And Electronics Engineering Tokuyama College Of Technology
-
Yoshinaga Tsunehiro
Department Of Computer Science And Electronic Engineering Tokuyama College Of Technology
関連論文
- Non-closure Property of One-Pebble Turing Machines with Sublogarithmic Space(Discrete Mathematics and Its Applications)
- 空間量が対数以下に制限された存在(全称)状態のみからなる1-インクドット交代チューリングマシンの閉包性について
- Space hierarchies of three-dimensional turing machines
- Some Properties on Input Head Reversal-Bounded Two-Dimensional Turing Machines (Special Issue on Selected Papers from LA Symposium)
- Self-Verifying Nondeterministic and Las Vegas Multihead Finite Automata (Special Section on Discrete Mathematics and Its Applications)
- A Relationship between Two-Way Deterministic One-Counter Automata and One-Pebble Deterministic Turing Machines with Sublogarithmic Space
- Alternating Rebound Turing Machines (Special Section on Discrete Mathematics and Its Applications)
- Some Observations Concerning Alternating Pushdown Automata with Sublogarithmic Space
- On Multi-Inkdot Two-Way Alternating Turing Machines and Pushdown Automata with Sublogarithmic Space and Constant Leaf-Size
- A Note on Alternating Pushdown Automata With Sublogarithmic Space
- Inkdot versus Pebble over Two-Dimensional Languages
- An algorithm for tower of hanoi with four or more poles
- A note on bottom-up pyramid acceptors
- Video file system
- A modified algorithm for taking reciprocal of n-bit integers
- Non-closure Properties of 1-Inkdot Nondeterministic Turing Machines and Alternating Turing Machines with Only Universal States Using Small Space
- A note on multihead on-line turing machines
- On Simple One-Way Multihead Pushdown Automata
- Sensing Two-Way Three Heads are Better than Two
- A Note on Alternating Multi-Counter Automata with Small Space
- A Note on Realtime One-Way Alternating and Deterministic Multi-Counter Automata(Special Issue on Selected Papers from LA Symposium)
- Las Vegas, Self-Verifying Nondeterministic and Deterministic One-Way Multi-Counter Automata with Bounded Time
- Three-dimensional multicounter auaomata
- Sublogarithmic Space-Bounded Multi-Inkdot Alternating Turing Machines with Only Existential (Universal) States(Discrete Mathematics and Its Applications)
- Polynomial Time-Bounded Alternating Multi-Counter Automata
- Some Observations on One-way Alternating Pushdown Automata with Sublinear Space(Discrete Mathematics and Its Applications)
- On 1-Inkdot Alternating Pushdown Automata with Sublogarithmic Space(Theory of Automata, Formal Language Theory)
- Some Observations on 1-Inkdot Alternating Multi-Counter Automata with Sublinear Space
- ALTERNATION FOR TWO-WAY (INKDOT) MULTI-COUNTER AUTOMATA WITH SUBLINEAR SPACE
- A leaf-size hierarchy of three-dimensional alternating turing Machines
- A note on decision problems for three-way two-dimensional finite automata
- D-1-3 Non-Closure Properties of Cooperating Systems of One-Way Alternating Finite Automata with Only Universal States