Hopcroft’s Algorithm and Cyclic Automata (Q3540107): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Around Hopcroft’s Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation and Application of Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Christoffel classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5725992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental Construction of Minimal Acyclic Finite-State Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Describing an algorithm by Hopcroft / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684962 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5551191 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Re-describing an algorithm by Hopcroft / 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: Q4443440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental Evaluation of Classical Automata Constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692934 / rank
 
Normal rank

Revision as of 19:44, 28 June 2024

scientific article
Language Label Description Also known as
English
Hopcroft’s Algorithm and Cyclic Automata
scientific article

    Statements

    Hopcroft’s Algorithm and Cyclic Automata (English)
    0 references
    0 references
    0 references
    0 references
    20 November 2008
    0 references
    Hopcroft's algorithm
    0 references
    minimal automaton
    0 references
    circular words
    0 references

    Identifiers