#### Filter Results:

- Full text PDF available (1)

#### Publication Year

1985

2014

- This year (0)
- Last 5 years (2)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Satoshi Okawa, Sadaki Hirose
- Theor. Comput. Sci.
- 2001

In this paper, we attempt to characterize the class of recursively enumerable languages with much smaller language classes than that of linear languages. Language classes, (i; j) LL and (i; j)ML, of (i; j) linear languages and (i; j) minimal linear languages are de ned by posing restrictions on the form of production rules and the number of nonterminals.… (More)

- Zoltán Ésik, Satoshi Okawa
- FSTTCS
- 1999

- Takafumi Hayashi, Takao Maeda, Satoshi Okawa
- IEICE Transactions
- 2011

- Takafumi Hayashi, Takao Maeda, Shinya Matsufuji, Satoshi Okawa
- IEICE Transactions
- 2011

- Satoshi Okawa, Sadaki Hirose
- IEICE Transactions
- 2006

- Sadaki Hirose, Satoshi Okawa, Masaaki Yoneda
- Theor. Comput. Sci.
- 1985

- Satoshi Okawa, Sadaki Hirose, Masaaki Yoneda
- Theor. Comput. Sci.
- 1986

- Zoltán Ésik, Satoshi Okawa
- Developments in Language Theory
- 2012

It is known that if a Büchi context-free language (BCFL) consists of scattered words, then there is an integer n, depending only on the language, such that the Hausdorff rank of each word in the language is bounded by n. Every BCFL is a Müller context-free language (MCFL). In the first part of the paper, we prove that an MCFL of scattered words is a BCFL… (More)

- Satoshi Okawa, Sadaki Hirose
- Systems and Computers in Japan
- 1991

- Takafumi Hayashi, Takao Maeda, Satoshi Okawa
- 2010 10th International Symposium on…
- 2010

The present paper introduces a new approach to the construction of a sequence set with a zero-correlation zone. The proposed sequences can be constructed from a pair of Hadamard matrices of the orders n<inf>0</inf> and n<inf>1</inf>. The constructed sequence set consists of n<inf>0</inf>n<inf>1</inf> ternary sequences, each of length… (More)