Namio Honda

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