Akira Ito
Affiliations:- Yamaguchi University, Department of Computer Science and Systems Engineering, Ube, Japan
According to our database1,
Akira Ito
authored at least 43 papers
between 1982 and 2007.
Collaborative distances:
Collaborative distances:
Timeline
1985
1990
1995
2000
2005
0
1
2
3
4
5
6
2
1
4
1
1
3
3
1
5
1
1
3
3
1
1
2
2
1
1
1
1
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2007
Sublogarithmically Space-Bounded Alternating One-Pebble Turing Machines with only Universal States.
Proceedings of the Formal Models, 2007
2006
Inf. Sci., 2006
Matrix L-System and Paper Folding with Scissors.
Proceedings of the 2006 International Conference on Foundations of Computer Science, 2006
2005
Theor. Comput. Sci., 2005
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005
IEICE Trans. Inf. Syst., 2005
2004
2003
Electron. Notes Discret. Math., 2003
2002
J. Autom. Lang. Comb., 2002
Inf. Sci., 2002
Proceedings of the Developments in Language Theory, 6th International Conference, 2002
2001
Theor. Comput. Sci., 2001
Closure Property of Space-Bounded Two-Dimensional Alternating Turing Machines, Pushdown Automata, and Counter Automata.
Int. J. Pattern Recognit. Artif. Intell., 2001
Closure Property of Probabilistic Turing Machines and Alternating Turing Machines with Sublogarithmic Spaces.
Int. J. Found. Comput. Sci., 2001
2000
Int. J. Pattern Recognit. Artif. Intell., 2000
1999
Closure Properties of the Classes of Sets Recognized by Space-Bounded Two-Dimensional Probabilistic Turing Machines.
Inf. Sci., 1999
Space Hierarchies of Two-Dimensional Alternating Turing Machines, Pushdown Automata and Counter Automata.
Int. J. Pattern Recognit. Artif. Intell., 1999
Int. J. Pattern Recognit. Artif. Intell., 1999
1998
1997
Int. J. Pattern Recognit. Artif. Intell., 1997
1995
Optimal Simulation of Two-Dimensional Alternating Finite Automata by Three-Way Nondeterministic Turing Machines.
Theor. Comput. Sci., 1995
Int. J. Pattern Recognit. Artif. Intell., 1995
1994
Inf. Sci., 1994
Int. J. Pattern Recognit. Artif. Intell., 1994
1993
Inf. Process. Lett., 1993
1992
A Relationship Between Nondeterministic Turing Machines and 1-Inkdot Turing Machines with Small Space.
Inf. Process. Lett., 1992
Proceedings of the Parallel Image Analysis, Second International Conference, 1992
1991
Theor. Comput. Sci., 1991
Int. J. Found. Comput. Sci., 1991
1989
Proceedings of the A Perspective in Theoretical Computer Science, 1989
Proceedings of the Array Grammars, Patterns and Recognizers, 1989
Deterministic Two-Dimensional On-Line Tessellation Acceptors are Equivalent to Two-Way Two-Dimensional Alternating Finite Automata Through 180°-Rotation.
Theor. Comput. Sci., 1989
Int. J. Pattern Recognit. Artif. Intell., 1989
1988
1986
Relationships of accepting powers between cellular space with bounded number of state-changes and other automata.
Syst. Comput. Jpn., 1986
1985
A space-hierarchy result on two-dimensional alternating Turing machines with only universal states.
Inf. Sci., 1985
1982
Inf. Control., 1982