Fuzzy Events Realized by Finite Probabilistic Automata - Masakazu Nasu; Namio Honda (Inf. Control., 1968)

Mappings Induced by PGSM-Mappings and Some Recursively Unsolvable Problems of Finite Probabilistic Automata - Masakazu Nasu; Namio Honda (Inf. Control., 1969)

A Context-Free Language Which is not Acceptable by a Probabilistic Automaton - Masakazu Nasu; Namio Honda (Inf. Control., 1971)

On the Extension of Gladkij's Theorem and the Hierarchies of Languages. - Yoshihide Igarashi; Namio Honda (J. Comput. Syst. Sci., 1973)

Logical Networks of Flexible Cells. - Akira Maruoka; Namio Honda (IEEE Trans. Computers, 1973)

Deterministic Multitape Automata Computations. - Yoshihide Igarashi; Namio Honda (J. Comput. Syst. Sci., 1974)

Erratum: On the Extension of Gladkij's Theorem and the Hierarchies of Languages. - Yoshihide Igarashi; Namio Honda (J. Comput. Syst. Sci., 1975)

The Range of Logical Flexibility of Tree Networks. - Akira Maruoka; Namio Honda (IEEE Trans. Computers, 1975)

Properties of Code Events and Homomorphisms over Regular Events. - Kosaburo Hashiguchi; Namio Honda (J. Comput. Syst. Sci., 1976)

A Completeness Property of One-Dimensional Tessellation Automata. - Masakazu Nasu; Namio Honda (J. Comput. Syst. Sci., 1976)

Homomorphisms That Preserve Star Height - Kosaburo Hashiguchi; Namio Honda (Inf. Control., 1976)

Certain Relations between Properties of Maps of Tessellation Automata. - Tadakazu Sato; Namio Honda (J. Comput. Syst. Sci., 1977)

The Decidability of Equivalence for Determistic Stateless Pushdown Automata - Michio Oyamaguchi; Namio Honda (Inf. Control., 1978)

The Star Height of Reset-Free Events and Strictly Locally Testable Events - Kosaburo Hashiguchi; Namio Honda (Inf. Control., 1979)

On the Equivalence Problem for Two DPDA's, One of which is Real-Time. - Michio Oyamaguchi; Yasuyoshi Inagaki; Namio Honda (IFIP Congress, 1980)

The Equivalence Problem for Real-Time Strict Deterministic Languages - Michio Oyamaguchi; Namio Honda (Inf. Control., 1980)

A Real-Time Strictness Test for Deterministic Pushdown Automata - Michio Oyamaguchi; Yasuyoshi Inagaki; Namio Honda (Inf. Control., 1980)

A Simplicity Test for Deterministic Pushdown Automata - Michio Oyamaguchi; Yasuyoshi Inagaki; Namio Honda (Inf. Control., 1980)

The Equivalence Problem for Two DPDA's, One of Which is a Finite-Turn or One-Counter Machine. - Michio Oyamaguchi; Yasuyoshi Inagaki; Namio Honda (J. Comput. Syst. Sci., 1981)

The Firing Squad Synchronization Problem for Graphs. - Yasuaki Nishitani; Namio Honda (Theor. Comput. Sci., 1981)

Specification of Abstract Data Types with Partially Defined Operations. - Toshiki Sakabe; Yasuyoshi Inagaki; Namio Honda (ICSE, 1982)

A Complete Axiom System for Algebra of Closed-Regular Expression. - Hiroyuki Izumi; Yasuyoshi Inagaki; Namio Honda (ICALP, 1984)

Distance functions defined by variable neighborhood sequences. - Masafumi Yamashita; Namio Honda (Pattern Recognit., 1984)

Dynamical Characteristics of Linear Cellular Automata. - Hirotomo Aso; Namio Honda (J. Comput. Syst. Sci., 1985)

Lower bounds on time complexity for some subgraph detection problems. - Masanari Arai; Masafumi Yamashita; Tomio Hirata; Toshihide Ibaraki; Namio Honda (Syst. Comput. Jpn., 1986)

A class of ambiguous linear term-rewriting systems on which call-by-need is a normalizing reduction strategy. - Tohru Naoi; Masafumi Yamashita; Toshihide Ibaraki; Namio Honda (Syst. Comput. Jpn., 1987)

Representation of Iterative Patterns. - Hiromoto Aso; Namio Honda (Int. J. Pattern Recognit. Artif. Intell., 1989)

Representation of iterative Patterns. - Hirotomo Aso; Namio Honda (Array Grammars, Patterns and Recognizers, 1989)