HYPER-MINIMIZATION FOR DETERMINISTIC TREE AUTOMATA (Q5401558): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: HYPER-MINIMIZATION IN O(n<sup>2</sup>) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyper-minimizing minimized deterministic finite state automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backward and forward bisimulation minimization of tree automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing deterministic weighted tree automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank

Latest revision as of 10:21, 7 July 2024

scientific article; zbMATH DE number 6266667
Language Label Description Also known as
English
HYPER-MINIMIZATION FOR DETERMINISTIC TREE AUTOMATA
scientific article; zbMATH DE number 6266667

    Statements

    HYPER-MINIMIZATION FOR DETERMINISTIC TREE AUTOMATA (English)
    0 references
    0 references
    0 references
    10 March 2014
    0 references
    hyper-minimization
    0 references
    state-minimization
    0 references
    finite automata
    0 references
    deterministic bottom-up tree automata
    0 references

    Identifiers