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:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

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
Other 

Links

On csauthors.net:

Bibliography

2007
Sublogarithmically Space-Bounded Alternating One-Pebble Turing Machines with only Universal States.
Proceedings of the Formal Models, 2007

2006
Three-way two-dimensional alternating finite automata with rotated inputs.
Inf. Sci., 2006

Matrix L-System and Paper Folding with Scissors.
Proceedings of the 2006 International Conference on Foundations of Computer Science, 2006

2005
Some properties of one-pebble Turing machines with sublogarithmic space.
Theor. Comput. Sci., 2005

Path-Bounded One-Way Multihead Finite Automata.
IEICE Trans. Inf. Syst., 2005

Inkdot versus Pebble over Two-Dimensional Languages.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

Three-Way Two-Dimensional Deterministic Finite Automata with Rotated Inputs.
IEICE Trans. Inf. Syst., 2005

2004
A Note On Rebound Turing Machines.
Int. J. Found. Comput. Sci., 2004

2003
A note on one-pebble two-dimensional Turing machines.
Electron. Notes Discret. Math., 2003

2002
Probabilistic rebound Turing machines.
Theor. Comput. Sci., 2002

A Leaf-Size Hierarchy of Alternating Rebound Turing Machines.
J. Autom. Lang. Comb., 2002

Non-closure property of space-bounded two-dimensional alternating Turing machines.
Inf. Sci., 2002

A Space Lower Bound of Two-Dimensional Probabilistic Turing Machines.
Proceedings of the Developments in Language Theory, 6th International Conference, 2002

2001
Alternation for sublogarithmic space-bounded alternating pushdown automata.
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
A Note on Three-Way Two-Dimensional Probabilistic Turing Machines.
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

A Note on Two-Dimensional Probabilistic Turing Machines.
Inf. Sci., 1999

A Note on Self-Modifying Finite Automata.
Inf. Process. Lett., 1999

Space Hierarchies of Two-Dimensional Alternating Turing Machines, Pushdown Automata and Counter Automata.
Int. J. Pattern Recognit. Artif. Intell., 1999

Decomposition Principle for Analyzing Region Quadtrees.
Int. J. Pattern Recognit. Artif. Intell., 1999

1998
A Note on Two-Dimensional Probabilistic Finite Automata.
Inf. Sci., 1998

1997
Nonclosure Properties of Two-Dimensional One-Marker Automata.
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

The Effect of Inkdots for Two-Dimensional Automata.
Int. J. Pattern Recognit. Artif. Intell., 1995

A Note on One-way Auxiliary Pushdown Automata.
IEICE Trans. Inf. Syst., 1995

1994
On 1-inkdot Alternating Turing Machines with Small Space.
Theor. Comput. Sci., 1994

Simulation of Three-Dimensional One-Marker Automata by Five-Way Turing Machines.
Inf. Sci., 1994

Constant Leaf-Size Hierarchy of Two-Dimensional Alternating Turing Machines.
Int. J. Pattern Recognit. Artif. Intell., 1994

1993
A Note on Multi-Inkdot Nondeterministic Turing Machines with Small Space.
Inf. Process. Lett., 1993

1992
A Relationship Between Nondeterministic Turing Machines and 1-Inkdot Turing Machines with Small Space.
Inf. Process. Lett., 1992

Constant Leaf-Size Hierarchy of Two-Dimensional Alternating Turing Machines.
Proceedings of the Parallel Image Analysis, Second International Conference, 1992

1991
A Note on Real-Time One-Way Alternating Multicounter Machines.
Theor. Comput. Sci., 1991

Alternating Turing Machines with Modified Accepting Structure.
Int. J. Found. Comput. Sci., 1991

1989
Complexity of Acceptance Problems for Two-Dimensional Automata.
Proceedings of the A Perspective in Theoretical Computer Science, 1989

The Simulation of Two-Dimensional One-Marker Automata by Three-Way Turing Machines.
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

The Simulation of Two-Dimensional One-Marker Automata by Three-Way Turing Machines.
Int. J. Pattern Recognit. Artif. Intell., 1989

1988
A note on three-way two-dimensional alternating Turing machines.
Inf. Sci., 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
Two-Dimensional Alternating Turing Machines with Only Universal States
Inf. Control., 1982


  Loading...