The complexity of intersecting finite automata having few final states (Q347114): Difference between revisions
From MaRDI portal
Latest revision as of 01:13, 13 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of intersecting finite automata having few final states |
scientific article |
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
