Max/Plus tree automata for termination of term rewriting (Q3077191)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Max/Plus tree automata for termination of term rewriting |
scientific article; zbMATH DE number 5854943
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Max/Plus tree automata for termination of term rewriting |
scientific article; zbMATH DE number 5854943 |
Statements
22 February 2011
0 references
term rewriting
0 references
termination
0 references
weighted tree automaton
0 references
max/plus algebra
0 references
arctic semiring
0 references
monotone algebra
0 references
matrix interpretation
0 references
formal verification
0 references
0.869526207447052
0 references
0.8631955981254578
0 references
0.8542314171791077
0 references
0.843520998954773
0 references
0.8363335132598877
0 references
