Namio Honda

Publication Activity (10 Years)

Years Active: 1968-1989
Publications (10 Years): 0

Publications

Hiromoto Aso, Namio Honda
Representation of Iterative Patterns. Int. J. Pattern Recognit. Artif. Intell. 3 (3-4) (1989)
Tohru Naoi, Masafumi Yamashita, Toshihide Ibaraki, Namio Honda
A class of ambiguous linear term-rewriting systems on which call-by-need is a normalizing reduction strategy. Systems and Computers in Japan 18 (9) (1987)
Masanari Arai, Masafumi Yamashita, Tomio Hirata, Toshihide Ibaraki, Namio Honda
Lower bounds on time complexity for some subgraph detection problems. Systems and Computers in Japan 17 (6) (1986)
Hirotomo Aso, Namio Honda
Dynamical Characteristics of Linear Cellular Automata. J. Comput. Syst. Sci. 30 (3) (1985)
Masafumi Yamashita, Namio Honda
Distance functions defined by variable neighborhood sequences. Pattern Recognit. 17 (5) (1984)
Hiroyuki Izumi, Yasuyoshi Inagaki, Namio Honda
A Complete Axiom System for Algebra of Closed-Regular Expression. ICALP (1984)
Toshiki Sakabe, Yasuyoshi Inagaki, Namio Honda
Specification of Abstract Data Types with Partially Defined Operations. ICSE (1982)
Michio Oyamaguchi, Yasuyoshi Inagaki, Namio Honda
The Equivalence Problem for Two DPDA's, One of Which is a Finite-Turn or One-Counter Machine. J. Comput. Syst. Sci. 23 (3) (1981)
Yasuaki Nishitani, Namio Honda
The Firing Squad Synchronization Problem for Graphs. Theor. Comput. Sci. 14 (1981)
Michio Oyamaguchi, Yasuyoshi Inagaki, Namio Honda
A Simplicity Test for Deterministic Pushdown Automata Inf. Control. 47 (1) (1980)
Michio Oyamaguchi, Namio Honda
The Equivalence Problem for Real-Time Strict Deterministic Languages Inf. Control. 45 (1) (1980)
Michio Oyamaguchi, Yasuyoshi Inagaki, Namio Honda
On the Equivalence Problem for Two DPDA's, One of which is Real-Time. IFIP Congress (1980)
Michio Oyamaguchi, Yasuyoshi Inagaki, Namio Honda
A Real-Time Strictness Test for Deterministic Pushdown Automata Inf. Control. 47 (1) (1980)
Kosaburo Hashiguchi, Namio Honda
The Star Height of Reset-Free Events and Strictly Locally Testable Events Inf. Control. 40 (3) (1979)
Michio Oyamaguchi, Namio Honda
The Decidability of Equivalence for Determistic Stateless Pushdown Automata Inf. Control. 38 (3) (1978)
Tadakazu Sato, Namio Honda
Certain Relations between Properties of Maps of Tessellation Automata. J. Comput. Syst. Sci. 15 (2) (1977)
Masakazu Nasu, Namio Honda
A Completeness Property of One-Dimensional Tessellation Automata. J. Comput. Syst. Sci. 12 (1) (1976)
Kosaburo Hashiguchi, Namio Honda
Homomorphisms That Preserve Star Height Inf. Control. 30 (3) (1976)
Kosaburo Hashiguchi, Namio Honda
Properties of Code Events and Homomorphisms over Regular Events. J. Comput. Syst. Sci. 12 (3) (1976)
Akira Maruoka, Namio Honda
The Range of Logical Flexibility of Tree Networks. IEEE Trans. Computers 24 (1) (1975)
Yoshihide Igarashi, Namio Honda
Erratum: On the Extension of Gladkij's Theorem and the Hierarchies of Languages. J. Comput. Syst. Sci. 11 (3) (1975)
Yoshihide Igarashi, Namio Honda
Deterministic Multitape Automata Computations. J. Comput. Syst. Sci. 8 (2) (1974)
Akira Maruoka, Namio Honda
Logical Networks of Flexible Cells. IEEE Trans. Computers 22 (4) (1973)
Yoshihide Igarashi, Namio Honda
On the Extension of Gladkij's Theorem and the Hierarchies of Languages. J. Comput. Syst. Sci. 7 (2) (1973)
Masakazu Nasu, Namio Honda
A Context-Free Language Which is not Acceptable by a Probabilistic Automaton Inf. Control. 18 (3) (1971)
Masakazu Nasu, Namio Honda
Mappings Induced by PGSM-Mappings and Some Recursively Unsolvable Problems of Finite Probabilistic Automata Inf. Control. 15 (3) (1969)
Masakazu Nasu, Namio Honda
Fuzzy Events Realized by Finite Probabilistic Automata Inf. Control. 12 (4) (1968)