Complexity of universality and related problems for partially ordered NFAs (Q2013561)
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: Complexity of universality and related problems for partially ordered NFAs |
scientific article; zbMATH DE number 6758670
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of universality and related problems for partially ordered NFAs |
scientific article; zbMATH DE number 6758670 |
Statements
Complexity of universality and related problems for partially ordered NFAs (English)
0 references
8 August 2017
0 references
automata
0 references
nondeterminism
0 references
partial order
0 references
universality
0 references
inclusion
0 references
equivalence
0 references
0 references
0.985417366027832
0 references
0.8622267246246338
0 references
0.7368287444114685
0 references
0.7312291860580444
0 references
0.7311394810676575
0 references
