A polynomial algorithm for uniqueness of normal forms of linear shallow term rewrite systems (Q613611): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Sequentiality, monadic second-order logic and tree automata. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Unique Normalization for Shallow TRS / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Automated Deduction – CADE-20 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Deciding confluence of certain term rewriting systems in polynomial time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Decidability and complexity analysis by basic paramodulation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complexity of Normal Form Properties and Reductions for Term Rewriting Problems Complexity of Normal Form Properties and Reductions for Term Rewriting Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2730723 / rank | |||
Normal rank | |||
Latest revision as of 14:48, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial algorithm for uniqueness of normal forms of linear shallow term rewrite systems |
scientific article |
Statements
A polynomial algorithm for uniqueness of normal forms of linear shallow term rewrite systems (English)
0 references
21 December 2010
0 references
term rewrite systems
0 references
uniqueness of normal forms
0 references
basic properties of rewrite systems
0 references
linear shallow rewrite systems
0 references
