LOWER BOUNDS FOR THE LENGTH OF RESET WORDS IN EULERIAN AUTOMATA (Q2841998): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Reset Sequences for Monotonic Automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Synchronizing finite automata on Eulerian digraphs. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Exponents of tuples of nonnegative matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Exponents of nonnegative matrix pairs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Exponents of 2-regular digraphs / 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: Unzerlegbare, nicht negative Matrizen / rank | |||
Normal rank |
Latest revision as of 17:18, 6 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | LOWER BOUNDS FOR THE LENGTH OF RESET WORDS IN EULERIAN AUTOMATA |
scientific article |
Statements
LOWER BOUNDS FOR THE LENGTH OF RESET WORDS IN EULERIAN AUTOMATA (English)
0 references
30 July 2013
0 references
synchronizing automaton
0 references
Černy conjecture
0 references
digraphs
0 references
exponent of a digraph
0 references
reset words
0 references