The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems (Q4013403): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Systems of reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confluent and Other Types of Thue Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidable sentences of Church-Rosser congruences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thue systems as rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the Church-Rosser property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Presentations of groups and monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(| T| ^ 3)\) algorithm for testing the Church-Rosser property of Thue systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036570 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using string-rewriting for solving the word problem for finitely presented groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Special monoids and special Thue systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On deciding the confluence of a finite string-rewriting system on a given congruence class / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completing a finite special string-rewriting system on the congruence class of the empty word / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision problems for finite special string-rewriting systems that are confluent on some congruence class / rank
 
Normal rank

Latest revision as of 14:09, 16 May 2024

scientific article
Language Label Description Also known as
English
The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems
scientific article

    Statements

    Identifiers