Slowly synchronizing automata with zero and noncomplete sets (Q2435786): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(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: Q4266486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing Automata and the Černý Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing automata preserving a chain of partial orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reset words for commutative and solvable automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A series of slowly synchronizing automata with a zero state over a small alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slowly Synchronizing Automata and Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing automata with a letter of deficiency 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Theory of Automata and Languages / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1134/s0001434611090094 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1919656470 / rank
 
Normal rank

Latest revision as of 10:36, 30 July 2024

scientific article
Language Label Description Also known as
English
Slowly synchronizing automata with zero and noncomplete sets
scientific article

    Statements

    Slowly synchronizing automata with zero and noncomplete sets (English)
    0 references
    20 February 2014
    0 references
    free monoid
    0 references
    noncomplete set
    0 references
    deterministic automaton
    0 references
    nondeterministic automaton
    0 references
    synchronizing automaton (with zero)
    0 references
    synchronizing word
    0 references
    maximal code
    0 references

    Identifiers