Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems (Q918215): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3702507 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variations on the Common Subexpression Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3811749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3323279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Decision Procedures Based on Congruence Closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Church-Rosser property for ground term-rewriting systems is decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient ground completion / rank
 
Normal rank

Latest revision as of 10:13, 21 June 2024

scientific article
Language Label Description Also known as
English
Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
scientific article

    Statements

    Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1990
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    confluence
    0 references
    infinite ground term rewrite systems
    0 references
    tree automata
    0 references
    tree transducers
    0 references