String execution time for finite languages: max is easy, min is hard (Q642653): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.automatica.2011.06.024 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2082516436 / rank | |||
Normal rank | |||
Revision as of 21:46, 19 March 2024
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
