Katsushi Inoue

According to our database1, Katsushi Inoue authored at least 100 papers between 1977 and 2007.

Collaborative distances:

Timeline

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

Sublogarithmic Space-Bounded Multi-Inkdot Alternating Turing Machines with Only Existential (Universal) States.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

Some properties of four-dimensional multicounter automata.
Artif. Life Robotics, 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

Three-dimensional multiinkdot automata.
Artif. Life Robotics, 2005

2004
On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata.
J. Comput. Syst. Sci., 2004

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

2003
Las Vegas, Self-Verifying Nondeterministic and Deterministic One-Way Multi-Counter Automata with Bounded Time.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 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

The Variable Precision Rough Set Inductive Logic Programming Model and Strings.
Comput. Intell., 2001

2000
Consistency and Completeness in Rough Sets.
J. Intell. Inf. Syst., 2000

Elementary sets and declarative biases in a restricted gRS-ILP model.
Informatica (Slovenia), 2000

A Note on Three-Way Two-Dimensional Probabilistic Turing Machines.
Int. J. Pattern Recognit. Artif. Intell., 2000

A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition
Electron. Colloquium Comput. Complex., 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

The Generic Rough Set Inductive Logic Programming Model and Motifs in Strings.
Proceedings of the New Directions in Rough Sets, 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

1996
Three-Dimensional Alternating Turing Machines with Only Universal States.
Inf. Sci., 1996

1995
Optimal Simulation of Two-Dimensional Alternating Finite Automata by Three-Way Nondeterministic Turing Machines.
Theor. Comput. Sci., 1995

Cooperating Systems of Three-Way, Two-Dimensional Finite Automata.
Int. J. Pattern Recognit. Artif. Intell., 1995

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

Alternating Finite Automata with Counters and Stack-Counters Operating in Realtime.
IEICE Trans. Inf. Syst., 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

A Characterization of Recognizable Picture Languages.
Int. J. Pattern Recognit. Artif. Intell., 1994

1993
A Note on Realtime One-Way Synchronized Alternating One-Counter Automata.
Theor. Comput. Sci., 1993

Construction of fault-tolerant mesh-connected highly parallel computer and its performance analysis.
Syst. Comput. Jpn., 1993

A note on three-dimensional alternating Turing machines with space smaller than log m.
Inf. Sci., 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

Two Topics Concerning Two-Dimensional Automata Operating in Parallel.
Int. J. Pattern Recognit. Artif. Intell., 1992

On the Power of One-Way Synchronized Alternating Machines with Small Space.
Int. J. Found. Comput. Sci., 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

A survey of two-dimensional automata theory.
Inf. Sci., 1991

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

1990
A note on time-bounded bottom-up pyramid cellular acceptors.
Inf. Sci., 1990

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

A Leaf-Size Hierarchy of Two-Dimensional Alternating Turing Machines.
Theor. Comput. Sci., 1989

One-Dimensional Bounded Cellular Acceptor with Rotated Inputs. A Relationship between ∧ and ∨ Types.
Syst. Comput. Jpn., 1989

Lower Bounds for Language Recognition on Two-Dimensional Alternating Multihead Machines.
J. Comput. Syst. 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

Some Considerations About NPRIORITY(1) Without ROM.
Inf. Process. Lett., 1988

1987
One-dimensional bounded cellular acceptor with rotated inputs.
Syst. Comput. Jpn., 1987

Hierarchical properties of the κ -neighborhood template A-type 2-dimensional bounded cellular acceptor.
Syst. Comput. Jpn., 1987

1986
Relationship between the accepting powers of (k, <i>l</i>)-neighborhood template δ-type one-dimensional bounded cellular acceptors and other types of two-dimensional automata.
Syst. Comput. Jpn., 1986

Relationships of accepting powers between cellular space with bounded number of state-changes and other automata.
Syst. Comput. Jpn., 1986

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

1985
Alternating Simple Multihead Finite Automata.
Theor. Comput. Sci., 1985

Alternating On-Line Turing Machines with Only Universal States and Small Space Bounds.
Theor. Comput. Sci., 1985

A space-hierarchy result on two-dimensional alternating Turing machines with only universal states.
Inf. Sci., 1985

1984
Connected pictures are not recognizable by deterministic two-dimensional on-line tessellation acceptors.
Comput. Vis. Graph. Image Process., 1984

1983
Two-Dimensional Pattern Matching by Two-Dimensional on-Line Tessellation Acceptors.
Theor. Comput. Sci., 1983

Two-Dimensional Alternating Turing Machines.
Theor. Comput. Sci., 1983

A Relationship between Two-Dimensional Finite Automata and Three-Way Tape-Bounded Two-Dimensional Turing Machines.
Theor. Comput. Sci., 1983

Two-dimensional automata with rotated inputs (projection-type).
Inf. Sci., 1983

1982
A note on three-dimensional finite automata.
Inf. Sci., 1982

A note on rebound automata.
Inf. Sci., 1982

A Note on Alternating On-Line Turing Machines.
Inf. Process. Lett., 1982

Two-Dimensional Alternating Turing Machines with Only Universal States
Inf. Control., 1982

1980
Two-dimensional automata with rotated inputs.
Inf. Sci., 1980

Nonclosure property of nondeterministic two-dimensional finite automata under cyclic closure.
Inf. Sci., 1980

Errata: Corrections to two papers.
Inf. Sci., 1980

A note on deterministic three-way tape-bounded two-dimensional Turing machines.
Inf. Sci., 1980

A Remark on Two-Dimensional Finite Automata.
Inf. Process. Lett., 1980

A Note on Decision Problems for Three-Way Two-Dimensional Finite Automata.
Inf. Process. Lett., 1980

1979
Two-Dimensional Multipass On-Line Tessellation Acceptors
Inf. Control., June, 1979

One-Way Simple Multihead Finite Automata.
Theor. Comput. Sci., 1979

On-line n-bounded multicounter automata.
Inf. Sci., 1979

Three-way tape-bounded two-dimensional turing machines.
Inf. Sci., 1979

Closure properties of three-way and four-way tape-bounded two-dimensional turing machines.
Inf. Sci., 1979

Three-way two-dimensional multicounter automata.
Inf. Sci., 1979

A Note on Bottom-Up Pyramid Acceptors.
Inf. Process. Lett., 1979

A Note on Cyclic Closure Operations.
Inf. Process. Lett., 1979

1978
Cyclic closure properties of automata on a two-dimensional tape.
Inf. Sci., 1978

A note on closure properties of the classes of sets accepted by tape-bounded two-dimensional turing machines.
Inf. Sci., 1978

A Note on Two-Dimensional Finite Automata.
Inf. Process. Lett., 1978

1977
Some properties of two-dimensional on-line tessellation acceptors.
Inf. Sci., 1977


  Loading...