The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Masakazu Nasu: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Masakazu Nasu
    Homomorphisms of graphs and their global maps. [Citation Graph (0, 0)][DBLP]
    Graph Theory and Algorithms, 1980, pp:159-170 [Conf]
  2. Sadaki Hirose, Masakazu Nasu
    Left Universal Context-Free Grammars and homomorphic Characterizations of Languages [Citation Graph (0, 0)][DBLP]
    Information and Control, 1981, v:50, n:2, pp:110-118 [Journal]
  3. Masakazu Nasu, Namio Honda
    Fuzzy Events Realized by Finite Probabilistic Automata [Citation Graph (0, 0)][DBLP]
    Information and Control, 1968, v:12, n:4, pp:284-303 [Journal]
  4. Masakazu Nasu, Namio Honda
    Mappings Induced by PGSM-Mappings and Some Recursively Unsolvable Problems of Finite Probabilistic Automata [Citation Graph (0, 0)][DBLP]
    Information and Control, 1969, v:15, n:3, pp:250-273 [Journal]
  5. Masakazu Nasu, Namio Honda
    A Context-Free Language Which is not Acceptable by a Probabilistic Automaton [Citation Graph (0, 0)][DBLP]
    Information and Control, 1971, v:18, n:3, pp:233-236 [Journal]
  6. Masanobu Ito, Nobuyasu Osato, Masakazu Nasu
    Linear Cellular Automata over Z_m. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1983, v:27, n:1, pp:125-140 [Journal]
  7. Masakazu Nasu, Namio Honda
    A Completeness Property of One-Dimensional Tessellation Automata. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1976, v:12, n:1, pp:36-48 [Journal]
  8. Masakazu Nasu
    Local Maps Inducing Surjective Global Maps of One-Dimensional Tesselation Automata. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1978, v:11, n:, pp:327-351 [Journal]
  9. Masakazu Nasu
    Indecomposable Local Maps of Tesselation Automata. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1979, v:13, n:, pp:81-93 [Journal]
  10. Masakazu Nasu
    Uniformly finite-to-one and onto extensions of homomorphisms between strongly connected graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:39, n:2, pp:171-197 [Journal]

Search in 0.002secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002