The complexity of intersecting finite automata having few final states (Q347114)
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: The complexity of intersecting finite automata having few final states |
scientific article; zbMATH DE number 6657788
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of intersecting finite automata having few final states |
scientific article; zbMATH DE number 6657788 |
Statements
The complexity of intersecting finite automata having few final states (English)
0 references
30 November 2016
0 references
finite automata
0 references
intersection problem
0 references
monoids
0 references
logspace
0 references
NP-completeness
0 references
point-spread problem
0 references
0 references
0 references
0 references
0.9712214469909668
0 references
0.8191354274749756
0 references
0.7950292229652405
0 references
0.7858266830444336
0 references
0.7778315544128418
0 references
