Descriptional complexity of unambiguous nested word automata (Q3004601)
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 5903583
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Descriptional complexity of unambiguous nested word automata |
scientific article; zbMATH DE number 5903583 |
Statements
Descriptional Complexity of Unambiguous Nested Word Automata (English)
0 references
3 June 2011
0 references
0.8880881071090698
0 references
0.8441966772079468
0 references
0.8153502345085144
0 references
0.8144026398658752
0 references
0.810603141784668
0 references
