State complexity of the concatenation of regular tree languages (Q418803)
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 6039185
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | State complexity of the concatenation of regular tree languages |
scientific article; zbMATH DE number 6039185 |
Statements
State complexity of the concatenation of regular tree languages (English)
0 references
30 May 2012
0 references
tree automata
0 references
state complexity
0 references
lower bounds
0 references
sequential and parallel concatenation
0 references
0.9121883511543274
0 references
0.9091817736625672
0 references
0.9058522582054138
0 references
0.8832029104232788
0 references
