A P-complete language describable with iterated shuffle (Q1197969): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(92)90165-r / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1989896950 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:07, 30 July 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
    0 references
    16 January 1993
    0 references
    computational complexity
    0 references
    formal language
    0 references
    \(P\)-complete language
    0 references

    Identifiers