Estimation of the length of reset words for automata with simple idempotents (Q5951300): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / cites work
 
Property / cites work: Q5509690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4171566 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reset Sequences for Monotonic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank of a finite automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5512231 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:56, 3 June 2024

scientific article; zbMATH DE number 1685396
Language Label Description Also known as
English
Estimation of the length of reset words for automata with simple idempotents
scientific article; zbMATH DE number 1685396

    Statements

    Estimation of the length of reset words for automata with simple idempotents (English)
    0 references
    0 references
    0 references
    2 December 2002
    0 references
    0 references
    finite automata with simple idempotents
    0 references
    0 references
    0 references
    0 references
    0 references