On termination of confluent one-rule string-rewriting systems (Q286976): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: ON THE WORD AND DIVISIBILITY PROBLEMS IN SEMIGROUPS WITH A SINGLE DEFINING RELATION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4846257 / 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: Q3998014 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3803350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision problems for semi-Thue systems with a few rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the termination problem for one-rule semi-Thue system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confluence of one-rule Thue systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete characterization of termination of 0p 1q→1r 0s / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(96)00200-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036341595 / rank
 
Normal rank

Latest revision as of 10:01, 30 July 2024

scientific article
Language Label Description Also known as
English
On termination of confluent one-rule string-rewriting systems
scientific article

    Statements

    On termination of confluent one-rule string-rewriting systems (English)
    0 references
    0 references
    0 references
    26 May 2016
    0 references
    0 references
    string-rewriting system
    0 references
    confluent system
    0 references
    decidability
    0 references
    termination problem
    0 references
    0 references