<technical report>
A P-Complete Language Describable with Iterated Shuffle
Creator | |
---|---|
Language | |
Publisher | |
Date | |
Source Title | |
Vol | |
Publication Type | |
Access Rights | |
Related DOI | |
Related URI | |
Relation | |
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. |
Hide fulltext details.
File | FileType | Size | Views | Description |
---|---|---|---|---|
rifis-tr-46 | 356 KB | 565 |
Details
Record ID | |
---|---|
Peer-Reviewed | |
Notes | |
Type | |
Created Date | 2009.04.22 |
Modified Date | 2017.01.20 |