Simulation of Turing machines by a regular rewrite rule (Q1199548): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Thue systems as rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulation of Turing machines by a left-linear rewrite rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted graphs: A tool for studying the halting problem and time complexity in term rewriting systems and logic programming / rank
 
Normal rank

Latest revision as of 16:18, 16 May 2024

scientific article
Language Label Description Also known as
English
Simulation of Turing machines by a regular rewrite rule
scientific article

    Statements

    Simulation of Turing machines by a regular rewrite rule (English)
    0 references
    16 January 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    infinite rewriting
    0 references
    undecidability
    0 references
    termination
    0 references
    0 references
    0 references