On the complexity of universality for partially ordered NFAs (Q4608624)
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 6851894
| 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 6851894 |
Statements
21 March 2018
0 references
automata
0 references
nondeterminism
0 references
partial order
0 references
universality
0 references
0.985417366027832
0 references
0.8693710565567017
0 references
0.731372594833374
0 references
0.7301362752914429
0 references
