A P-Complete Language Describable with Iterated Shuffle - Collections

＜technical report＞
A P-Complete Language Describable with Iterated Shuffle

Creator	Author PID K000176 Creator Name Shoudai, Takayoshi 正代, 隆義 Affiliation Affiliation Name Department of Control Engineering and Science Kyushu Institute of Technology 九州工業大学情報工学部制御システム工学科
Language	English
Publisher	Research Institute of Fundamental Information Science, Kyushu University
Publisher	九州大学理学部附属基礎情報学研究施設
Date	1991-09-06
Source Title	RIFIS Technical Report
Vol	46
Publication Type	Accepted Manuscript
Access Rights	open access
Related DOI	RIFIS Technical Report \|\| 46 \|\| p1-6
Related DOI	http://www.i.kyushu-u.ac.jp/research/report.html
Related URI	RIFIS Technical Report \|\| 46 \|\| p1-6
Related URI	http://www.i.kyushu-u.ac.jp/research/report.html
Relation	RIFIS Technical Report \|\| 46 \|\| p1-6
Relation	http://www.i.kyushu-u.ac.jp/research/report.html
Abstract	We show that a P-complete language can be described by using the shuffle operator, shufle closure, union, concatenation, Kleene star and intersection on a finite alphabet.

File	FileType	Size	Views	Description
rifis-tr-46	pdf	356 KB	538

Record ID	3152
Peer-Reviewed	Unrefereed
Notes	Information Processing Letters 41, 233-238, 1992
Type	テクニカルレポート
Created Date	2009.04.22
Modified Date	2017.01.20