Name
Affiliation
Papers
KATSUSHI INOUE
Department of Electronics, Faculty of Engineering, Yamaguchi University, Ube, 755 Japan
91
Collaborators
Citations 
PageRank 
67
515
74.43
Referers 
Referees 
References 
344
255
492
Search Limit
100344
Title
Citations
PageRank
Year
Sublogarithmic Space-Bounded Multi-Inkdot Alternating Turing Machines with Only Existential (Universal) States10.372006
Matrix L-System and Paper Folding with Scissors00.342006
Some properties of four-dimensional multicounter automata00.342006
Three-way two-dimensional alternating finite automata with rotated inputs10.372006
Path-Bounded One-Way Multihead Finite Automata00.342005
Inkdot versus Pebble over Two-Dimensional Languages00.342005
Some properties of one-pebble turing machines with sublogarithmic space20.422005
Three-Way Two-Dimensional Deterministic Finite Automata With Rotated Inputs10.372005
Three-dimensional multiinkdot automata10.402005
A note on one-pebble two-dimensional Turing machines30.482004
On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata10.372004
A Note On Rebound Turing Machines00.342004
Las Vegas, Self-Verifying Nondeterministic And Deterministic One-Way Multi-Counter Automata With Bounded Time00.342003
Probabilistic rebound Turing machines00.342002
Non-closure property of space-bounded two-dimensional alternating turing machines00.342002
A space lower bound of two-dimensional probabilistic turing machines00.342002
A leaf-size hierarchy of alternating rebound Turing machines10.402002
Closure Property of Probabilistic Turing Machines and Alternating Turing Machines with Sublogarithmic Spaces00.342001
Alternation for sublogarithmic space-bounded alternating pushdown automata20.412001
Closure Property Of Space-Bounded Two-Dimensional Alternating Turing Machines, Pushdown Automata, And Counter Automata20.442001
The Variable Precision Rough Set Inductive Logic Programming Model And Strings50.542001
Elementary sets and declarative biases in a restricted gRS-ILP model30.432000
Consistency and Completeness in Rough Sets10.372000
A Note On Three-Way Two-Dimensional Probabilistic Turing Machines00.342000
A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition30.402000
Closure properties of the classes of sets recognized by space-bounded two-dimensional probalistic turing machines10.361999
The Generic Rough Set Inductive Logic Programming Model and Motifs in Strings20.581999
A note on two-dimensional probabilistic Turing machines30.411999
Space Hierarchies Of Two-Dimensional Alternating Turing Machines, Pushdown Automata And Counter Automata00.341999
Decomposition Principle For Analyzing Region Quadtrees00.341999
A note on two-dimensional probabilistic finite automata50.461998
Nonclosure Properties Of Two-Dimensional One-Marker Automata30.451997
Three-dimensional alternating Turing machines with only universal states00.341996
The Effect Of Inkdots For 2-Dimensional Automata20.451995
Alternating Finite Automata With Counters And Stack-Counters Operating In Realtime00.341995
Cooperating Systems Of 3-Way, 2-Dimensional Finite Automata00.341995
Optimal simulation of two-dimensional alternating finite automata by three-way nondeterministic Turing machines00.341995
A Note on One-way Auxiliary Pushdown Automata.00.341995
Simulation of three-dimensional one-marker automata by five-way Turing machines10.401994
On 1-inkdot alternating Turing machines with small space40.511994
A note on three-dimensional alternating Turing machines with space smaller than log m10.361993
Construction of fault-tolerant mesh-connected highly parallel computer and its performance analysis00.341993
A note on multi-inkdot nondeterministic Turing machines with small space20.411993
A note on realtime one-way synchronized alternating one-counter automata30.571993
Constant leaf-size hierarchy of two-dimensional alternating Turing machines10.371992
Parallel Image Analysis, Second International Conference, ICPIA '92, Ube, Japan, December 21-23, 1992, Proceedings244.081992
A relationship between nondeterministic Turing machines and 1-inkdot Turing machines with small space40.591992
A characterization of recognizable picture languages271.861992
Two topics concerning two-dimensional automata operating in parallel20.441992
On the Power of One-Way Synchronized Alternating Machines with Small Space20.561992
  • 1
  • 2