 | 2006 |
|---|
| 11 |       | Satoshi Okawa,
Sadaki Hirose:
The Relations among Watson-Crick Automata and Their Relations with Context-Free Languages.
IEICE Transactions 89-D(10): 2591-2599 (2006) |
| 2005 |
|---|
| 10 | | Takafumi Hayashi,
Takao Maeda,
Satoshi Okawa:
Upper Bounds of the Correlation Functions of a Class of Binary Zero-Correlation-Zone Sequences.
IEICE Transactions 88-A(3): 791-794 (2005) |
| 9 | | Sadaki Hirose,
Satoshi Okawa:
On Computational Power of Insertion-Deletion Systems without Using Contexts.
IEICE Transactions 88-D(8): 1993-1995 (2005) |
| 2003 |
|---|
| 8 |  | Sadaki Hirose,
Satoshi Okawa:
Characterizations of Language Classes: Universal Grammars, Dyck Reductions, and Homomorphisms.
Grammars and Automata for String Processing 2003: 253-262 |
| 7 | | Satoru Watanabe,
Satoshi Okawa:
An Extended Star Graph: A Proposal of a New Network Topology and Its Fundamental Properties.
ISPA 2003: 220-227 |
| 2001 |
|---|
| 6 | | Pál Dömösi,
Satoshi Okawa:
A Chomsky-Schützenberger-Stanley Type Characterization of the Class of Slender Context-Free Languages.
Acta Cybern. 15(1): 25-32 (2001) |
| 5 | | Satoshi Okawa,
Sadaki Hirose:
Homomorphic characterizations of recursively enumerable languages with very small language classes.
Theor. Comput. Sci. 250(1-2): 55-69 (2001) |
| 1999 |
|---|
| 4 | | Zoltán Ésik,
Satoshi Okawa:
Series and Parallel Operations on Pomsets.
FSTTCS 1999: 316-328 |
| 3 | | Pál Dömösi,
Satoshi Okawa,
Sadaki Hirose:
A Chomsky and Stanley Type Homomorphic Characterization of the Class of Linear Languages.
Bulletin of the EATCS 68: 151 (1999) |
| 1986 |
|---|
| 2 | | Satoshi Okawa,
Sadaki Hirose,
Masaaki Yoneda:
On the Impossibility of the Homomorphic Characterization of Context-Sensitive Languages.
Theor. Comput. Sci. 44: 225-228 (1986) |
| 1985 |
|---|
| 1 | | Sadaki Hirose,
Satoshi Okawa,
Masaaki Yoneda:
A Homomorphic Characterization of Recursively Enumerable Languages.
Theor. Comput. Sci. 35: 261-269 (1985) |
