Lower Space Bounds for Accepting Shuffle Languages (Q4718896): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2053799526 / 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: Q3862379 / 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: Software Descriptions with Flow Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing machines with sublogarithmic space / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of iterated shuffle / rank
 
Normal rank

Latest revision as of 11:46, 29 May 2024

scientific article; zbMATH DE number 1382913
Language Label Description Also known as
English
Lower Space Bounds for Accepting Shuffle Languages
scientific article; zbMATH DE number 1382913

    Statements