Equational approximations for tree automata completion (Q968530)
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: Equational approximations for tree automata completion |
scientific article; zbMATH DE number 5704033
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Equational approximations for tree automata completion |
scientific article; zbMATH DE number 5704033 |
Statements
Equational approximations for tree automata completion (English)
0 references
5 May 2010
0 references
verification
0 references
term rewriting systems
0 references
reachability
0 references
tree automata
0 references
rewriting modulo equations
0 references
0 references
0.8607417941093445
0 references
0.8134384751319885
0 references
0.7992375493049622
0 references
0.7927049398422241
0 references
0.7913395166397095
0 references
