RESTRICTED SETS OF TRAJECTORIES AND DECIDABILITY OF SHUFFLE DECOMPOSITIONS (Q5704372): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deletion along trajectories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing machines with restricted memory access / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aspects of shuffle and deletion on trajectories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shuffle on trajectories: Syntactic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thin and slender languages / rank
 
Normal rank

Latest revision as of 12:44, 11 June 2024

scientific article; zbMATH DE number 2228595
Language Label Description Also known as
English
RESTRICTED SETS OF TRAJECTORIES AND DECIDABILITY OF SHUFFLE DECOMPOSITIONS
scientific article; zbMATH DE number 2228595

    Statements