Average complexity of Moore's and Hopcroft's algorithms (Q764328): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56830054, #quickstatements; #temporary_batch_1710865376617 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2011.10.011 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2074847588 / rank | |||
Normal rank | |||
Revision as of 20:26, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Average complexity of Moore's and Hopcroft's algorithms |
scientific article |
Statements
Average complexity of Moore's and Hopcroft's algorithms (English)
0 references
13 March 2012
0 references
finite automata
0 references
minimization algorithm
0 references
Moore algorithm
0 references
Hopcroft algorithm
0 references
average complexity
0 references
generic complexity
0 references
