A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONE-CLUSTER AUTOMATA (Q3086238): Difference between revisions
From MaRDI portal
Added link to MaRDI 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: Strongly transitive automata and the Černý conjecture / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Almost all complete binary prefix codes have a self-synchronizing string / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On synchronizing prefix codes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The road coloring problem / rank | |||
Normal rank | |||
Latest revision as of 21:46, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONE-CLUSTER AUTOMATA |
scientific article |
Statements
A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONE-CLUSTER AUTOMATA (English)
0 references
30 March 2011
0 references
Černý's conjecture
0 references
synchronized automaton
0 references
synchronized maximal prefix code
0 references
Huffman code
0 references
