Fast brief practical DFA minimization (Q437674): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
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
18 July 2012
0 references
formal languages
0 references
data structures
0 references
deterministic finite automata
0 references
partition refinement
0 references