A P-complete language describable with iterated shuffle (Q1197969): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Flow languages equal recursively enumerable languages / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The power of synchronizing operations on strings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Extending regular expressions with iterated shuffle / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the enlargement of the class of regular languages by the shuffle closure / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Software Descriptions with Flow Expressions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the complexity of iterated shuffle / rank | |||
Normal rank | |||
Revision as of 15:34, 16 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A P-complete language describable with iterated shuffle |
scientific article |
Statements
A P-complete language describable with iterated shuffle (English)
0 references
16 January 1993
0 references
computational complexity
0 references
formal language
0 references
\(P\)-complete language
0 references
