A geometrical view of the determinization and minimization of finite-state automata (Q3210193): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A syntactic congruence for rational \(\omega\)-languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic automata and context-free sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Automaton Transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-state \(\omega\)-languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5723183 / rank
 
Normal rank

Latest revision as of 14:06, 21 June 2024

scientific article
Language Label Description Also known as
English
A geometrical view of the determinization and minimization of finite-state automata
scientific article

    Statements

    A geometrical view of the determinization and minimization of finite-state automata (English)
    0 references
    0 references
    0 references
    0 references
    1991
    0 references
    determinization
    0 references
    minimization
    0 references
    rectangular decompositions of relations
    0 references
    recognizability in algebraic structures
    0 references
    finite-state word
    0 references
    tree automaton
    0 references

    Identifiers