Equational approximations for tree automata completion (Q968530): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:26, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Equational approximations for tree automata completion |
scientific article |
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
