Fast brief practical DFA minimization (Q437674): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2011.12.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2038358049 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4045961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Describing an algorithm by Hopcroft / rank
 
Normal rank
Property / cites work
 
Property / cites work: Re-describing an algorithm by Hopcroft / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Minimization of DFAs with Partial Transition Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimilarity Minimization in O(m logn) Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Bisimilarity Minimization in O(m log n) Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Partition Refinement Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank

Latest revision as of 12:21, 5 July 2024

scientific article
Language Label Description Also known as
English
Fast brief practical DFA minimization
scientific article

    Statements

    Fast brief practical DFA minimization (English)
    0 references
    0 references
    18 July 2012
    0 references
    formal languages
    0 references
    data structures
    0 references
    deterministic finite automata
    0 references
    partition refinement
    0 references

    Identifiers