String execution time for finite languages: max is easy, min is hard (Q642653)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | String execution time for finite languages: max is easy, min is hard |
scientific article |
Statements
String execution time for finite languages: max is easy, min is hard (English)
0 references
27 October 2011
0 references
languages
0 references
finite-state automata
0 references
(max
0 references
+) semiring
0 references
heap models
0 references
computational complexity
0 references
