Almost optimal bound of recurrent word length for regular automata (Q1922340): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4171566 / rank
 
Normal rank
Property / cites work
 
Property / cites work: In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank of a finite automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3832610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3293418 / rank
 
Normal rank

Latest revision as of 14:17, 24 May 2024

scientific article
Language Label Description Also known as
English
Almost optimal bound of recurrent word length for regular automata
scientific article

    Statements

    Almost optimal bound of recurrent word length for regular automata (English)
    0 references
    0 references
    0 references
    3 February 1997
    0 references
    0 references
    algebraic method for cyclic automata
    0 references