State complexity of subtree-free regular tree languages (Q2843085)
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: State complexity of subtree-free regular tree languages |
scientific article; zbMATH DE number 6197261
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | State complexity of subtree-free regular tree languages |
scientific article; zbMATH DE number 6197261 |
Statements
State Complexity of Subtree-Free Regular Tree Languages (English)
0 references
9 August 2013
0 references
deterministic ranked tree automata
0 references
state complexity
0 references
subtree-free regular tree language
0 references
basic operations
0 references
0.9862521290779114
0 references
0.8653656244277954
0 references
0.8580193519592285
0 references
0.8571267127990723
0 references
0.839398205280304
0 references
