Akira Ito

46 papers B 1C 1Journal 38Unranked 4
YearRankTypeTitle / Venue / Authors
2007 — conf
Sublogarithmically Space-Bounded Alternating One-Pebble Turing Machines with only Universal States.
Formal Models, Languages and Applications
Katsushi Inoue, Akira Ito, Atsuyuki Inoue
2006 — conf
Matrix L-System and Paper Folding with Scissors.
FCS
Katsushi Inoue, Akira Ito, Yue Wang
2006 J jnl
Three-way two-dimensional alternating finite automata with rotated inputs.
Inf. Sci.
Hisao Hirakawa, Katsushi Inoue, Akira Ito
2005 J jnl
Inkdot versus Pebble over Two-Dimensional Languages.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Atsuyuki Inoue, Akira Ito, Kunihiko Hiraishi, Katsushi Inoue
2005 J jnl
Path-Bounded One-Way Multihead Finite Automata.
IEICE Trans. Inf. Syst.
Satoshi Inoue, Katsushi Inoue, Akira Ito, Yue Wang
2005 J jnl
Some properties of one-pebble Turing machines with sublogarithmic space.
Theor. Comput. Sci.
Atsuyuki Inoue, Akira Ito, Katsushi Inoue, Tokio Okazaki
2005 J jnl
Three-Way Two-Dimensional Deterministic Finite Automata with Rotated Inputs.
IEICE Trans. Inf. Syst.
Hisao Hirakawa, Katsushi Inoue, Akira Ito
2004 J jnl
A Note On Rebound Turing Machines.
Int. J. Found. Comput. Sci.
Katsushi Inoue, Akira Ito, Takashi Kamiura, Holger Petersen, Lan Zhang
2004 J jnl
A note on one-pebble two-dimensional Turing machines.
Inf. Sci.
Atsuyuki Inoue, Katsushi Inoue, Akira Ito, Yue Wang, Tokio Okazaki
2003 J jnl
A note on one-pebble two-dimensional Turing machines.
Electron. Notes Discret. Math.
Atsuyuki Inoue, Katsushi Inoue, Akira Ito, Yue Wang, Tokio Okazaki
2003 B conf
Some Properties of One-Pebble Turing Machines with Sublogarithmic Space.
ISAAC
Atsuyuki Inoue, Akira Ito, Katsushi Inoue, Tokio Okazaki
2002 J jnl
A Leaf-Size Hierarchy of Alternating Rebound Turing Machines.
J. Autom. Lang. Comb.
Lan Zhang, Katsushi Inoue, Akira Ito, Yue Wang
2002 C conf
A Space Lower Bound of Two-Dimensional Probabilistic Turing Machines.
Developments in Language Theory
Yuji Sasaki, Katsushi Inoue, Akira Ito, Yue Wang
2002 J jnl
Non-closure property of space-bounded two-dimensional alternating Turing machines.
Inf. Sci.
Tokio Okazaki, Atsuyuki Inoue, Katsushi Inoue, Akira Ito, Yue Wang
2002 J jnl
Probabilistic rebound Turing machines.
Theor. Comput. Sci.
Lan Zhang, Katsushi Inoue, Akira Ito, Yue Wang
2001 J jnl
Alternation for sublogarithmic space-bounded alternating pushdown automata.
Theor. Comput. Sci.
Jianliang Xu, Tsunehiro Yoshinaga, Katsushi Inoue, Yue Wang, Akira Ito
2001 J jnl
Closure Property of Probabilistic Turing Machines and Alternating Turing Machines with Sublogarithmic Spaces.
Int. J. Found. Comput. Sci.
Géza Harváth, Katsushi Inoue, Akira Ito, Yue Wang
2001 J jnl
Closure Property of Space-Bounded Two-Dimensional Alternating Turing Machines, Pushdown Automata, and Counter Automata.
Int. J. Pattern Recognit. Artif. Intell.
Tokio Okazaki, Katsushi Inoue, Akira Ito, Yue Wang
2000 J jnl
A Note on Three-Way Two-Dimensional Probabilistic Turing Machines.
Int. J. Pattern Recognit. Artif. Intell.
Tokio Okazaki, Katsushi Inoue, Akira Ito, Yue Wang
1999 J jnl
A Note on Self-Modifying Finite Automata.
Inf. Process. Lett.
Yue Wang, Katsushi Inoue, Akira Ito, Tokio Okazaki
1999 J jnl
A Note on Two-Dimensional Probabilistic Turing Machines.
Inf. Sci.
Tokio Okazaki, Katsushi Inoue, Akira Ito, Yue Wang
1999 J jnl
Closure Properties of the Classes of Sets Recognized by Space-Bounded Two-Dimensional Probabilistic Turing Machines.
Inf. Sci.
Tokio Okazaki, Katsushi Inoue, Akira Ito, Yue Wang
1999 J jnl
Decomposition Principle for Analyzing Region Quadtrees.
Int. J. Pattern Recognit. Artif. Intell.
Akira Ito, Katsushi Inoue, Yue Wang
1999 J jnl
Space Hierarchies of Two-Dimensional Alternating Turing Machines, Pushdown Automata and Counter Automata.
Int. J. Pattern Recognit. Artif. Intell.
Tokio Okazaki, Katsushi Inoue, Akira Ito, Yue Wang
1998 J jnl
A Note on Two-Dimensional Probabilistic Finite Automata.
Inf. Sci.
Tokio Okazaki, Lan Zhang, Katsushi Inoue, Akira Ito, Yue Wang
1997 J jnl
Nonclosure Properties of Two-Dimensional One-Marker Automata.
Int. J. Pattern Recognit. Artif. Intell.
Akira Ito, Katsushi Inoue, Yue Wang
1995 J jnl
A Note on One-way Auxiliary Pushdown Automata.
IEICE Trans. Inf. Syst.
Yue Wang, Jianliang Xu, Katsushi Inoue, Akira Ito
1995 J jnl
Optimal Simulation of Two-Dimensional Alternating Finite Automata by Three-Way Nondeterministic Turing Machines.
Theor. Comput. Sci.
Akira Ito, Katsushi Inoue, Itsuo Takanami, Yue Wang
1995 J jnl
The Effect of Inkdots for Two-Dimensional Automata.
Int. J. Pattern Recognit. Artif. Intell.
Akira Ito, Katsushi Inoue, Itsuo Takanami, Yue Wang
1994 J jnl
Constant Leaf-Size Hierarchy of Two-Dimensional Alternating Turing Machines.
Int. J. Pattern Recognit. Artif. Intell.
Akira Ito, Katsushi Inoue, Itsuo Takanami, Yasuyoshi Inagaki
1994 J jnl
On 1-inkdot Alternating Turing Machines with Small Space.
Theor. Comput. Sci.
Katsushi Inoue, Akira Ito, Itsuo Takanami
1994 J jnl
Simulation of Three-Dimensional One-Marker Automata by Five-Way Turing Machines.
Inf. Sci.
Makoto Sakamoto, Akira Ito, Katsushi Inoue, Itsuo Takanami
1993 J jnl
A Note on Multi-Inkdot Nondeterministic Turing Machines with Small Space.
Inf. Process. Lett.
Katsushi Inoue, Akira Ito, Itsuo Takanami, Tsunehiro Yoshinaga
1992 J jnl
A Relationship Between Nondeterministic Turing Machines and 1-Inkdot Turing Machines with Small Space.
Inf. Process. Lett.
Katsushi Inoue, Akira Ito, Itsuo Takanami
1992 — conf
Constant Leaf-Size Hierarchy of Two-Dimensional Alternating Turing Machines.
ICPIA
Akira Ito, Katsushi Inoue, Itsuo Takanami
1991 J jnl
A Note on Real-Time One-Way Alternating Multicounter Machines.
Theor. Comput. Sci.
Katsushi Inoue, Akira Ito, Itsuo Takanami
1991 J jnl
Alternating Turing Machines with Modified Accepting Structure.
Int. J. Found. Comput. Sci.
Katsushi Inoue, Akira Ito, Itsuo Takanami
1989 — ch.
Complexity of Acceptance Problems for Two-Dimensional Automata.
A Perspective in Theoretical Computer Science
Akira Ito, Katsushi Inoue, Itsuo Takanami
1989 J jnl
Deterministic Two-Dimensional On-Line Tessellation Acceptors are Equivalent to Two-Way Two-Dimensional Alternating Finite Automata Through 180°-Rotation.
Theor. Comput. Sci.
Akira Ito, Katsushi Inoue, Itsuo Takanami
1989 J jnl
The Simulation of Two-Dimensional One-Marker Automata by Three-Way Turing Machines.
Int. J. Pattern Recognit. Artif. Intell.
Akira Ito, Katsushi Inoue, Itsuo Takanami
1989 — ch.
The Simulation of Two-Dimensional One-Marker Automata by Three-Way Turing Machines.
Array Grammars, Patterns and Recognizers
Akira Ito, Katsushi Inoue, Itsuo Takanami
1988 J jnl
A note on three-way two-dimensional alternating Turing machines.
Inf. Sci.
Akira Ito, Katsushi Inoue, Itsuo Takanami
1988 — conf
The Simulation of Two-Dimensional One-Marker Automata by Three-Way Turing Machines.
IMYCS
Akira Ito, Katsushi Inoue, Itsuo Takanami
1986 J jnl
Relationships of accepting powers between cellular space with bounded number of state-changes and other automata.
Syst. Comput. Jpn.
Akira Ito, Katsushi Inoue, Itsuo Takanami, Hiroshi Taniguchi
1985 J jnl
A space-hierarchy result on two-dimensional alternating Turing machines with only universal states.
Inf. Sci.
Katsushi Inoue, Akira Ito, Itsuo Takanami, Hiroshi Taniguchi
1982 J jnl
Two-Dimensional Alternating Turing Machines with Only Universal States
Inf. Control.
Akira Ito, Katsushi Inoue, Itsuo Takanami, Hiroshi Taniguchi