Search the dblp DataBase
Tetsuo Moriya: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Tetsuo Moriya
An Incompleteness Theorem for One-Dimensional Binary Cellular Acceptors [Citation Graph (0, 0)][DBLP]
Information and Control, 1981, v:50, n:3, pp:185-198 [Journal] - Tetsuo Moriya
Closure Property of Principal Cones Under Substitution. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1988, v:29, n:6, pp:315-317 [Journal] - Tetsuo Moriya, Hideki Yamasaki
Literal Shuffle on omega-Languages. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1996, v:59, n:3, pp:165-168 [Journal] - Tetsuo Moriya
Pebble machines and tree walking machines. [Citation Graph (0, 0)][DBLP]
Inf. Sci., 1982, v:27, n:2, pp:99-119 [Journal] - Tetsuo Moriya
omega Languages accepted by finite automata whose structures are cascade products of resets. [Citation Graph (0, 0)][DBLP]
Inf. Sci., 1992, v:61, n:1-2, pp:179-186 [Journal] - Tetsuo Moriya
Topological Characterizations of Infinite Tree Languages. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1987, v:52, n:, pp:165-171 [Journal] - Tetsuo Moriya, Hideki Yamasaki
Accepting Conditions for Automata on omega-Languages. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1988, v:61, n:, pp:137-147 [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 |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002