Minimizing finite automata is computationally hard (Q703578): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2004.03.070 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1964127120 / rank | |||
Normal rank | |||
Revision as of 18:04, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing finite automata is computationally hard |
scientific article |
Statements
Minimizing finite automata is computationally hard (English)
0 references
11 January 2005
0 references
Finite automata
0 references
Limited nondeterminism
0 references
Minimization
0 references
NP-complete
0 references
