On confluence versus strong confluence for one-rule trace-rewriting systems (Q4841769): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4385532 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Completion of a Set of Rules Modulo a Set of Equations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5581665 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3698316 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Preperfectness is undecidable for Thue systems containing only length- reducing rules and a single commutation rule / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on thue systems with a single defining relation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On confluence of one-rule trace-rewriting systems / rank | |||
Normal rank |
Revision as of 15:53, 23 May 2024
scientific article; zbMATH DE number 778432
Language | Label | Description | Also known as |
---|---|---|---|
English | On confluence versus strong confluence for one-rule trace-rewriting systems |
scientific article; zbMATH DE number 778432 |
Statements
On confluence versus strong confluence for one-rule trace-rewriting systems (English)
0 references
24 July 1995
0 references
trace-rewriting systems
0 references
string-rewriting systems
0 references
0 references