|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/5034
|
| タイトル: | Well-quasi-orders and regular ω-languages |
| 著者: | Ogawa, Mizuhito |
| キーワード: | ω-language
well-quasi-order
regularity |
| 発行日: | 2004-09-16 |
| 出版者: | Elsevier |
| 誌名: | Theoretical Computer Science |
| 巻: | 324 |
| 号: | 1 |
| 開始ページ: | 55 |
| 終了ページ: | 60 |
| DOI: | 10.1016/j.tcs.2004.03.052 |
| 抄録: | In “On regularity of context-free languages, Theoretical Computer Science Vol.27,pp.311-332, 1983”, Ehrenfeucht et al. showed that a set L of finite words is regular if and only if L is ≤ closed under some monotone well-quasi-order (WQO) ≤ over finite words. We extend this result to regular ω-languages. That is, (1) an ω-language L is regular if and only if L is ≤-closed under a periodic extension ≤ of some monotone WQO over finite words, and (2) an ω-language L is regular if and only if L is ≤-closed under a WQO ≤ over ω-words that is a continuous extension of some monotone WQO over finite words. |
| Rights: | NOTICE: This is the author’s version of a work accepted for publication by Elsevier. Changes resulting from the publishing process, including peer review, editing, corrections, structural formatting and other quality control mechanisms, may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Mizuhito Ogawa, Theoretical Computer Science, 324(1), 2004, 55-60, http://dx.doi.org/10.1016/j.tcs.2004.03.052 |
| URI: | http://hdl.handle.net/10119/5034 |
| 資料タイプ: | author |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| C9486.pdf | | 101Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
