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
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
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
Property / cites work
 
Property / cites work: Around Hopcroft’s Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: REGAL: A Library to Randomly and Exhaustively Generate Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5389971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration and random generation of accessible automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation and Application of Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5725992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hopcroft’s Algorithm and Cyclic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Extremal Cases of Hopcroft’s Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4412568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4855565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Describing an algorithm by Hopcroft / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic-case complexity, decision problems in group theory, and random walks. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Re-describing an algorithm by Hopcroft / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Automaton Transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimisation of acyclic deterministic automata in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2715788 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Minimization of DFAs with Partial Transition Functions / rank
 
Normal rank

Latest revision as of 00:28, 5 July 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
    0 references
    13 March 2012
    0 references
    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
    0 references
    0 references