Handling left-quadratic rules when completing tree automata (Q4982086)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6418595
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Handling left-quadratic rules when completing tree automata |
scientific article; zbMATH DE number 6418595 |
Statements
Handling Left-Quadratic Rules When Completing Tree Automata (English)
0 references
23 March 2015
0 references
rewriting techniques
0 references
tree automata
0 references
left-linearity
0 references
security
0 references
0 references
0.9238826036453248
0 references
0.8340732455253601
0 references
0.7709622979164124
0 references
0.7681917548179626
0 references
0.7486369609832764
0 references
