On the Complexity of Universality for Partially Ordered NFAs (Q4608625)
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 6851895
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Complexity of Universality for Partially Ordered NFAs |
scientific article; zbMATH DE number 6851895 |
Statements
21 March 2018
0 references
Eulerian paths
0 references
regular languages
0 references
0.8403668
0 references
0.8321892
0 references
0.8289554
0 references
0.8279178
0 references
0.82301474
0 references
0.81974304
0 references
0.8161502
0 references
On the Complexity of Universality for Partially Ordered NFAs (English)
0 references
