Test sets for the universal and existential closure of regular tree languages. (Q1400712)
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: Test sets for the universal and existential closure of regular tree languages. |
scientific article; zbMATH DE number 1964175
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Test sets for the universal and existential closure of regular tree languages. |
scientific article; zbMATH DE number 1964175 |
Statements
Test sets for the universal and existential closure of regular tree languages. (English)
0 references
2002
0 references
term rewriting
0 references
ground reducibility
0 references
0.8930403
0 references
0.88971597
0 references
0 references
0.88021505
0 references
0.86195004
0 references
0.8614994
0 references
