Some properties of two-dimensional on-line tessellation acceptors. - Katsushi Inoue; Akira Nakamura (Inf. Sci., 1977)

A Note on Two-Dimensional Finite Automata. - Katsushi Inoue; Itsuo Takanami; Akira Nakamura (Inf. Process. Lett., 1978)

A note on closure properties of the classes of sets accepted by tape-bounded two-dimensional turing machines. - Katsushi Inoue; Itsuo Takanami (Inf. Sci., 1978)

Cyclic closure properties of automata on a two-dimensional tape. - Katsushi Inoue; Itsuo Takanami (Inf. Sci., 1978)

A Note on Cyclic Closure Operations. - Katsushi Inoue; Itsuo Takanami (Inf. Process. Lett., 1979)

A Note on Bottom-Up Pyramid Acceptors. - Katsushi Inoue; Itsuo Takanami (Inf. Process. Lett., 1979)

Three-way two-dimensional multicounter automata. - Katsushi Inoue; Itsuo Takanami (Inf. Sci., 1979)

Closure properties of three-way and four-way tape-bounded two-dimensional turing machines. - Katsushi Inoue; Itsuo Takanami (Inf. Sci., 1979)

Three-way tape-bounded two-dimensional turing machines. - Katsushi Inoue; Itsuo Takanami (Inf. Sci., 1979)

On-line n-bounded multicounter automata. - Katsushi Inoue; Itsuo Takanami (Inf. Sci., 1979)

One-Way Simple Multihead Finite Automata. - Katsushi Inoue; Itsuo Takanami; Akira Nakamura; Tadashi Ae (Theor. Comput. Sci., 1979)

Two-Dimensional Multipass On-Line Tessellation Acceptors - Katsushi Inoue; Akira Nakamura (Inf. Control., 1979)

A Note on Decision Problems for Three-Way Two-Dimensional Finite Automata. - Katsushi Inoue; Itsuo Takanami (Inf. Process. Lett., 1980)

A Remark on Two-Dimensional Finite Automata. - Akira Nakamura; Katsushi Inoue (Inf. Process. Lett., 1980)

A note on deterministic three-way tape-bounded two-dimensional Turing machines. - Katsushi Inoue; Itsuo Takanami (Inf. Sci., 1980)

Errata: Corrections to two papers. - Katsushi Inoue; Itsuo Takanami (Inf. Sci., 1980)

Nonclosure property of nondeterministic two-dimensional finite automata under cyclic closure. - Katsushi Inoue; Itsuo Takanami; Akira Nakamura (Inf. Sci., 1980)

Two-dimensional automata with rotated inputs. - Katsushi Inoue; Itsuo Takanami; Hiroshi Taniguchi (Inf. Sci., 1980)

Two-Dimensional Alternating Turing Machines with Only Universal States - Akira Ito 001; Katsushi Inoue; Itsuo Takanami; Hiroshi Taniguchi (Inf. Control., 1982)

A Note on Alternating On-Line Turing Machines. - Katsushi Inoue; Itsuo Takanami; Hiroshi Taniguchi (Inf. Process. Lett., 1982)

A note on rebound automata. - Katsushi Inoue; Itsuo Takanami; Hiroshi Taniguchi (Inf. Sci., 1982)

A note on three-dimensional finite automata. - Hiroshi Taniguchi; Katsushi Inoue; Itsuo Takanami (Inf. Sci., 1982)

Two-dimensional automata with rotated inputs (projection-type). - Katsushi Inoue; Itsuo Takanami; Hiroshi Taniguchi (Inf. Sci., 1983)

A Relationship between Two-Dimensional Finite Automata and Three-Way Tape-Bounded Two-Dimensional Turing Machines. - Katsushi Inoue; Itsuo Takanami; Hiroshi Taniguchi (Theor. Comput. Sci., 1983)

Two-Dimensional Alternating Turing Machines. - Katsushi Inoue; Itsuo Takanami; Hiroshi Taniguchi (Theor. Comput. Sci., 1983)

Two-Dimensional Pattern Matching by Two-Dimensional on-Line Tessellation Acceptors. - Manabu Toda; Katsushi Inoue; Itsuo Takanami (Theor. Comput. Sci., 1983)

Connected pictures are not recognizable by deterministic two-dimensional on-line tessellation acceptors. - Katsushi Inoue; Itsuo Takanami; Akira Nakamura (Comput. Vis. Graph. Image Process., 1984)

A space-hierarchy result on two-dimensional alternating Turing machines with only universal states. - Katsushi Inoue; Akira Ito 001; Itsuo Takanami; Hiroshi Taniguchi (Inf. Sci., 1985)

Alternating On-Line Turing Machines with Only Universal States and Small Space Bounds. - Katsushi Inoue; Itsuo Takanami; Roland Vollmar (Theor. Comput. Sci., 1985)

Alternating Simple Multihead Finite Automata. - Hiroshi Matsuno; Katsushi Inoue; Hiroshi Taniguchi; Itsuo Takanami (Theor. Comput. Sci., 1985)

Three-way two-dimensional finite automata with rotated inputs. - Katsushi Inoue; Itsuo Takanami; Roland Vollmar (Inf. Sci., 1986)

Relationships of accepting powers between cellular space with bounded number of state-changes and other automata. - Akira Ito 001; Katsushi Inoue; Itsuo Takanami; Hiroshi Taniguchi (Syst. Comput. Jpn., 1986)

Relationship between the accepting powers of (k, l)-neighborhood template δ-type one-dimensional bounded cellular acceptors and other types of two-dimensional automata. - Hiroshi Taniguchi; Katsushi Inoue; Itsuo Takanami; Shigeko Seki (Syst. Comput. Jpn., 1986)

Hierarchical properties of the κ -neighborhood template A-type 2-dimensional bounded cellular acceptor. - Hiroshi Taniguchi; Katsushi Inoue; Itsuo Takanami (Syst. Comput. Jpn., 1987)

One-dimensional bounded cellular acceptor with rotated inputs. - Hiroshi Taniguchi; Katsushi Inoue; Itsuo Takanami (Syst. Comput. Jpn., 1987)

Some Considerations About NPRIORITY(1) Without ROM. - Katsushi Inoue; Itsuo Takanami (Inf. Process. Lett., 1988)

A note on three-way two-dimensional alternating Turing machines. - Akira Ito 001; Katsushi Inoue; Itsuo Takanami (Inf. Sci., 1988)

The Simulation of Two-Dimensional One-Marker Automata by Three-Way Turing Machines. - Akira Ito 001; Katsushi Inoue; Itsuo Takanami (Int. J. Pattern Recognit. Artif. Intell., 1989)

Lower Bounds for Language Recognition on Two-Dimensional Alternating Multihead Machines. - Juraj Hromkovic; Katsushi Inoue; Itsuo Takanami (J. Comput. Syst. Sci., 1989)

One-Dimensional Bounded Cellular Acceptor with Rotated Inputs. A Relationship between ∧ and ∨ Types. - Hiroshi Taniguchi; Katsushi Inoue; Itsuo Takanami (Syst. Comput. Jpn., 1989)

A Leaf-Size Hierarchy of Two-Dimensional Alternating Turing Machines. - Katsushi Inoue; Itsuo Takanami; Juraj Hromkovic (Theor. Comput. Sci., 1989)

Deterministic Two-Dimensional On-Line Tessellation Acceptors are Equivalent to Two-Way Two-Dimensional Alternating Finite Automata Through 180°-Rotation. - Akira Ito 001; Katsushi Inoue; Itsuo Takanami (Theor. Comput. Sci., 1989)

The Simulation of Two-Dimensional One-Marker Automata by Three-Way Turing Machines. - Akira Ito 001; Katsushi Inoue; Itsuo Takanami (Array Grammars, Patterns and Recognizers, 1989)

Complexity of Acceptance Problems for Two-Dimensional Automata. - Akira Ito 001; Katsushi Inoue; Itsuo Takanami (A Perspective in Theoretical Computer Science, 1989)

A note on time-bounded bottom-up pyramid cellular acceptors. - Katsushi Inoue; Itsuo Takanami; Akira Nakamura (Inf. Sci., 1990)

Alternating Turing Machines with Modified Accepting Structure. - Katsushi Inoue; Akira Ito 001; Itsuo Takanami (Int. J. Found. Comput. Sci., 1991)

A survey of two-dimensional automata theory. - Katsushi Inoue; Itsuo Takanami (Inf. Sci., 1991)

A Note on Real-Time One-Way Alternating Multicounter Machines. - Katsushi Inoue; Akira Ito 001; Itsuo Takanami (Theor. Comput. Sci., 1991)

Constant Leaf-Size Hierarchy of Two-Dimensional Alternating Turing Machines. - Akira Ito 001; Katsushi Inoue; Itsuo Takanami (ICPIA, 1992)

On the Power of One-Way Synchronized Alternating Machines with Small Space. - Juraj Hromkovic; Katsushi Inoue; Branislav Rovan; Anna Slobodová; Itsuo Takanami; Klaus W. Wagner (Int. J. Found. Comput. Sci., 1992)

Two Topics Concerning Two-Dimensional Automata Operating in Parallel. - Katsushi Inoue; Itsuo Sakuramoto; Makoto Sakamoto; Itsuo Takanami (Int. J. Pattern Recognit. Artif. Intell., 1992)

A Relationship Between Nondeterministic Turing Machines and 1-Inkdot Turing Machines with Small Space. - Katsushi Inoue; Akira Ito 001; Itsuo Takanami (Inf. Process. Lett., 1992)

A Note on Multi-Inkdot Nondeterministic Turing Machines with Small Space. - Katsushi Inoue; Akira Ito 001; Itsuo Takanami; Tsunehiro Yoshinaga (Inf. Process. Lett., 1993)

A note on three-dimensional alternating Turing machines with space smaller than log m. - Makoto Sakamoto; Katsushi Inoue; Itsuo Takanami (Inf. Sci., 1993)

Construction of fault-tolerant mesh-connected highly parallel computer and its performance analysis. - Itsuo Takanami; Katsushi Inoue; Takahiro Watanabe; Minoru Oka (Syst. Comput. Jpn., 1993)

A Note on Realtime One-Way Synchronized Alternating One-Counter Automata. - Juraj Hromkovic; Katsushi Inoue (Theor. Comput. Sci., 1993)

A Characterization of Recognizable Picture Languages. - Katsushi Inoue; Itsuo Takanami (Int. J. Pattern Recognit. Artif. Intell., 1994)

Constant Leaf-Size Hierarchy of Two-Dimensional Alternating Turing Machines. - Akira Ito 001; Katsushi Inoue; Itsuo Takanami; Yasuyoshi Inagaki (Int. J. Pattern Recognit. Artif. Intell., 1994)

Simulation of Three-Dimensional One-Marker Automata by Five-Way Turing Machines. - Makoto Sakamoto; Akira Ito 001; Katsushi Inoue; Itsuo Takanami (Inf. Sci., 1994)

On 1-inkdot Alternating Turing Machines with Small Space. - Katsushi Inoue; Akira Ito 001; Itsuo Takanami (Theor. Comput. Sci., 1994)

A Note on One-way Auxiliary Pushdown Automata. - Yue Wang 002; Jianliang Xu; Katsushi Inoue; Akira Ito 001 (IEICE Trans. Inf. Syst., 1995)

Alternating Finite Automata with Counters and Stack-Counters Operating in Realtime. - Tsunehiro Yoshinaga; Katsushi Inoue (IEICE Trans. Inf. Syst., 1995)

The Effect of Inkdots for Two-Dimensional Automata. - Akira Ito 001; Katsushi Inoue; Itsuo Takanami; Yue Wang 002 (Int. J. Pattern Recognit. Artif. Intell., 1995)

Cooperating Systems of Three-Way, Two-Dimensional Finite Automata. - Yue Wang 002; Katsushi Inoue; Itsuo Takanami (Int. J. Pattern Recognit. Artif. Intell., 1995)

Optimal Simulation of Two-Dimensional Alternating Finite Automata by Three-Way Nondeterministic Turing Machines. - Akira Ito 001; Katsushi Inoue; Itsuo Takanami; Yue Wang 002 (Theor. Comput. Sci., 1995)

Three-Dimensional Alternating Turing Machines with Only Universal States. - Makoto Sakamoto; Katsushi Inoue (Inf. Sci., 1996)

Nonclosure Properties of Two-Dimensional One-Marker Automata. - Akira Ito 001; Katsushi Inoue; Yue Wang 002 (Int. J. Pattern Recognit. Artif. Intell., 1997)

A Note on Two-Dimensional Probabilistic Finite Automata. - Tokio Okazaki; Lan Zhang; Katsushi Inoue; Akira Ito 001; Yue Wang 002 (Inf. Sci., 1998)

The Generic Rough Set Inductive Logic Programming Model and Motifs in Strings. - Arul Siromoney; Katsushi Inoue (RSFDGrC, 1999)

Decomposition Principle for Analyzing Region Quadtrees. - Akira Ito 001; Katsushi Inoue; Yue Wang 002 (Int. J. Pattern Recognit. Artif. Intell., 1999)

Space Hierarchies of Two-Dimensional Alternating Turing Machines, Pushdown Automata and Counter Automata. - Tokio Okazaki; Katsushi Inoue; Akira Ito 001; Yue Wang 002 (Int. J. Pattern Recognit. Artif. Intell., 1999)

A Note on Self-Modifying Finite Automata. - Yue Wang 002; Katsushi Inoue; Akira Ito 001; Tokio Okazaki (Inf. Process. Lett., 1999)

A Note on Two-Dimensional Probabilistic Turing Machines. - Tokio Okazaki; Katsushi Inoue; Akira Ito 001; Yue Wang 002 (Inf. Sci., 1999)

Closure Properties of the Classes of Sets Recognized by Space-Bounded Two-Dimensional Probabilistic Turing Machines. - Tokio Okazaki; Katsushi Inoue; Akira Ito 001; Yue Wang 002 (Inf. Sci., 1999)

A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition - Pavol Duris; Juraj Hromkovic; Katsushi Inoue (Electron. Colloquium Comput. Complex., 2000)

A Note on Three-Way Two-Dimensional Probabilistic Turing Machines. - Tokio Okazaki; Katsushi Inoue; Akira Ito 001; Yue Wang 002 (Int. J. Pattern Recognit. Artif. Intell., 2000)

Elementary sets and declarative biases in a restricted gRS-ILP model. - Arul Siromoney; Katsushi Inoue (Informatica (Slovenia), 2000)

Consistency and Completeness in Rough Sets. - Arul Siromoney; Katsushi Inoue (J. Intell. Inf. Syst., 2000)

The Variable Precision Rough Set Inductive Logic Programming Model and Strings. - V. Uma Maheswari 002; Arul Siromoney; K. M. Mehata; Katsushi Inoue (Comput. Intell., 2001)

Closure Property of Probabilistic Turing Machines and Alternating Turing Machines with Sublogarithmic Spaces. - Géza Harváth; Katsushi Inoue; Akira Ito 001; Yue Wang 002 (Int. J. Found. Comput. Sci., 2001)

Closure Property of Space-Bounded Two-Dimensional Alternating Turing Machines, Pushdown Automata, and Counter Automata. - Tokio Okazaki; Katsushi Inoue; Akira Ito 001; Yue Wang 002 (Int. J. Pattern Recognit. Artif. Intell., 2001)

Alternation for sublogarithmic space-bounded alternating pushdown automata. - Jianliang Xu; Tsunehiro Yoshinaga; Katsushi Inoue; Yue Wang 002; Akira Ito 001 (Theor. Comput. Sci., 2001)

A Space Lower Bound of Two-Dimensional Probabilistic Turing Machines. - Yuji Sasaki; Katsushi Inoue; Akira Ito 001; Yue Wang 002 (Developments in Language Theory, 2002)

Non-closure property of space-bounded two-dimensional alternating Turing machines. - Tokio Okazaki; Atsuyuki Inoue; Katsushi Inoue; Akira Ito 001; Yue Wang 002 (Inf. Sci., 2002)

A Leaf-Size Hierarchy of Alternating Rebound Turing Machines. - Lan Zhang; Katsushi Inoue; Akira Ito 001; Yue Wang 002 (J. Autom. Lang. Comb., 2002)

Probabilistic rebound Turing machines. - Lan Zhang; Katsushi Inoue; Akira Ito 001; Yue Wang 002 (Theor. Comput. Sci., 2002)

A note on one-pebble two-dimensional Turing machines. - Atsuyuki Inoue; Katsushi Inoue; Akira Ito 001; Yue Wang 002; Tokio Okazaki (Electron. Notes Discret. Math., 2003)

Las Vegas, Self-Verifying Nondeterministic and Deterministic One-Way Multi-Counter Automata with Bounded Time. - Tsunehiro Yoshinaga; Katsushi Inoue (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003)

A Note On Rebound Turing Machines. - Katsushi Inoue; Akira Ito 001; Takashi Kamiura; Holger Petersen 001; Lan Zhang (Int. J. Found. Comput. Sci., 2004)

On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata. - Pavol Duris; Juraj Hromkovic; Katsushi Inoue (J. Comput. Syst. Sci., 2004)

Three-dimensional multiinkdot automata. - Tadayuki Makino; Hidenobu Okabe; Shinya Taniguchi; Makoto Sakamoto; Katsushi Inoue (Artif. Life Robotics, 2005)

Three-Way Two-Dimensional Deterministic Finite Automata with Rotated Inputs. - Hisao Hirakawa; Katsushi Inoue; Akira Ito 001 (IEICE Trans. Inf. Syst., 2005)

Inkdot versus Pebble over Two-Dimensional Languages. - Atsuyuki Inoue; Akira Ito 001; Kunihiko Hiraishi; Katsushi Inoue (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005)

Path-Bounded One-Way Multihead Finite Automata. - Satoshi Inoue; Katsushi Inoue; Akira Ito 001; Yue Wang 002 (IEICE Trans. Inf. Syst., 2005)

Some properties of one-pebble Turing machines with sublogarithmic space. - Atsuyuki Inoue; Akira Ito 001; Katsushi Inoue; Tokio Okazaki (Theor. Comput. Sci., 2005)

Matrix L-System and Paper Folding with Scissors. - Katsushi Inoue; Akira Ito 001; Yue Wang 002 (FCS, 2006)

Some properties of four-dimensional multicounter automata. - Makoto Saito; Makoto Sakamoto; Youichirou Nakama; Takao Ito; Katsushi Inoue; Hiroshi Furutani; Susumu Katayama (Artif. Life Robotics, 2006)

Sublogarithmic Space-Bounded Multi-Inkdot Alternating Turing Machines with Only Existential (Universal) States. - Tsunehiro Yoshinaga; Jianliang Xu; Katsushi Inoue (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006)

Three-way two-dimensional alternating finite automata with rotated inputs. - Hisao Hirakawa; Katsushi Inoue; Akira Ito 001 (Inf. Sci., 2006)

Sublogarithmically Space-Bounded Alternating One-Pebble Turing Machines with only Universal States. - Katsushi Inoue; Akira Ito 001; Atsuyuki Inoue (Formal Models, Languages and Applications, 2007)