Infinite hierarchy of shuffle expressions over a finite alphabet (Q918713): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Transition graphs and the star-height of regular events / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shuffle languages, Petri nets, and context-sensitive grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphisms that preserve star height / 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: Nesting of shuffle closure is important / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite hierarchy of expressions containing shuffle closure operator / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of iterated shuffle / rank
 
Normal rank

Latest revision as of 09:23, 21 June 2024

scientific article
Language Label Description Also known as
English
Infinite hierarchy of shuffle expressions over a finite alphabet
scientific article

    Statements

    Identifiers