Minimizing finite automata is computationally hard (Q703578): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2004.03.070 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2004.03.070 / rank | |||
Normal rank | |||
Latest revision as of 01:10, 10 December 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
