| |
| 1983 | ||
|---|---|---|
| 10 | Masanobu Ito, Nobuyasu Osato, Masakazu Nasu: Linear Cellular Automata over Z_m. J. Comput. Syst. Sci. 27(1): 125-140 (1983) | |
| 1982 | ||
| 9 | EE | Masakazu Nasu: Uniformly finite-to-one and onto extensions of homomorphisms between strongly connected graphs. Discrete Mathematics 39(2): 171-197 (1982) |
| 1981 | ||
| 8 | Sadaki Hirose, Masakazu Nasu: Left Universal Context-Free Grammars and homomorphic Characterizations of Languages Information and Control 50(2): 110-118 (1981) | |
| 1980 | ||
| 7 | Masakazu Nasu: Homomorphisms of graphs and their global maps. Graph Theory and Algorithms 1980: 159-170 | |
| 1979 | ||
| 6 | Masakazu Nasu: Indecomposable Local Maps of Tesselation Automata. Mathematical Systems Theory 13: 81-93 (1979) | |
| 1978 | ||
| 5 | Masakazu Nasu: Local Maps Inducing Surjective Global Maps of One-Dimensional Tesselation Automata. Mathematical Systems Theory 11: 327-351 (1978) | |
| 1976 | ||
| 4 | Masakazu Nasu, Namio Honda: A Completeness Property of One-Dimensional Tessellation Automata. J. Comput. Syst. Sci. 12(1): 36-48 (1976) | |
| 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) | |
| 1 | Sadaki Hirose | [8] |
| 2 | Namio Honda | [1] [2] [3] [4] |
| 3 | Masanobu Ito | [10] |
| 4 | Nobuyasu Osato | [10] |