| 1985 |
|---|
| 23 | | Hirotomo Aso,
Namio Honda:
Dynamical Characteristics of Linear Cellular Automata.
J. Comput. Syst. Sci. 30(3): 291-317 (1985) |
| 1984 |
|---|
| 22 | | Hiroyuki Izumi,
Yasuyoshi Inagaki,
Namio Honda:
A Complete Axiom System for Algebra of Closed-Regular Expression.
ICALP 1984: 260-269 |
| 21 | EE | Masafumi Yamashita,
Namio Honda:
Distance functions defined by variable neighborhood sequences.
Pattern Recognition 17(5): 509-513 (1984) |
| 1982 |
|---|
| 20 | | Toshiki Sakabe,
Yasuyoshi Inagaki,
Namio Honda:
Specification of Abstract Data Types with Partially Defined Operations.
ICSE 1982: 218-224 |
| 1981 |
|---|
| 19 | | 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): 366-382 (1981) |
| 18 | | Yasuaki Nishitani,
Namio Honda:
The Firing Squad Synchronization Problem for Graphs.
Theor. Comput. Sci. 14: 39-61 (1981) |
| 1980 |
|---|
| 17 | | Michio Oyamaguchi,
Yasuyoshi Inagaki,
Namio Honda:
On the Equivalence Problem for Two DPDA's, One of which is Real-Time.
IFIP Congress 1980: 53-58 |
| 16 | | Michio Oyamaguchi,
Namio Honda:
The Equivalence Problem for Real-Time Strict Deterministic Languages
Information and Control 45(1): 90-115 (1980) |
| 15 | | Michio Oyamaguchi,
Yasuyoshi Inagaki,
Namio Honda:
A Real-Time Strictness Test for Deterministic Pushdown Automata
Information and Control 47(1): 1-9 (1980) |
| 14 | | Michio Oyamaguchi,
Yasuyoshi Inagaki,
Namio Honda:
A Simplicity Test for Deterministic Pushdown Automata
Information and Control 47(1): 10-36 (1980) |
| 1979 |
|---|
| 13 | | Kosaburo Hashiguchi,
Namio Honda:
The Star Height of Reset-Free Events and Strictly Locally Testable Events
Information and Control 40(3): 267-284 (1979) |
| 1978 |
|---|
| 12 | | Michio Oyamaguchi,
Namio Honda:
The Decidability of Equivalence for Determistic Stateless Pushdown Automata
Information and Control 38(3): 367-376 (1978) |
| 1977 |
|---|
| 11 | | Tadakazu Sato,
Namio Honda:
Certain Relations between Properties of Maps of Tessellation Automata.
J. Comput. Syst. Sci. 15(2): 121-145 (1977) |
| 1976 |
|---|
| 10 | | Kosaburo Hashiguchi,
Namio Honda:
Homomorphisms That Preserve Star Height
Information and Control 30(3): 247-266 (1976) |
| 9 | | Masakazu Nasu,
Namio Honda:
A Completeness Property of One-Dimensional Tessellation Automata.
J. Comput. Syst. Sci. 12(1): 36-48 (1976) |
| 8 | | Kosaburo Hashiguchi,
Namio Honda:
Properties of Code Events and Homomorphisms over Regular Events.
J. Comput. Syst. Sci. 12(3): 352-367 (1976) |
| 1975 |
|---|
| 7 | | Akira Maruoka,
Namio Honda:
The Range of Logical Flexibility of Tree Networks.
IEEE Trans. Computers 24(1): 9-28 (1975) |
| 6 | | Yoshihide Igarashi,
Namio Honda:
Erratum: On the Extension of Gladkij's Theorem and the Hierarchies of Languages.
J. Comput. Syst. Sci. 11(3): 397 (1975) |
| 1974 |
|---|
| 5 | | Yoshihide Igarashi,
Namio Honda:
Deterministic Multitape Automata Computations.
J. Comput. Syst. Sci. 8(2): 167-189 (1974) |
| 1973 |
|---|
| 4 | | Yoshihide Igarashi,
Namio Honda:
On the Extension of Gladkij's Theorem and the Hierarchies of Languages.
J. Comput. Syst. Sci. 7(2): 199-217 (1973) |
| 1971 |
|---|
| 3 | | Masakazu Nasu,
Namio Honda:
A Context-Free Language Which is not Acceptable by a Probabilistic Automaton
Information and Control 18(3): 233-236 (1971) |
| 1969 |
|---|
| 2 | | Masakazu Nasu,
Namio Honda:
Mappings Induced by PGSM-Mappings and Some Recursively Unsolvable Problems of Finite Probabilistic Automata
Information and Control 15(3): 250-273 (1969) |
| 1968 |
|---|
| 1 | | Masakazu Nasu,
Namio Honda:
Fuzzy Events Realized by Finite Probabilistic Automata
Information and Control 12(4): 284-303 (1968) |
