![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 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) | |
| 9 | Sadaki Hirose, Satoshi Okawa: On Computational Power of Insertion-Deletion Systems without Using Contexts. IEICE Transactions 88-D(8): 1993-1995 (2005) | |
| 8 | Sadaki Hirose, Satoshi Okawa: Characterizations of Language Classes: Universal Grammars, Dyck Reductions, and Homomorphisms. Grammars and Automata for String Processing 2003: 253-262 | |
| 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) | |
| 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) | |
| 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) | |
| 1 | Sadaki Hirose, Satoshi Okawa, Masaaki Yoneda: A Homomorphic Characterization of Recursively Enumerable Languages. Theor. Comput. Sci. 35: 261-269 (1985) |
Selection of 7 from 11 records - Satoshi Okawa has 7 coauthors
Copyright © 2009-12-01 by Michael Ley (ley@uni-trier.de)