A lower bound for the length of the shortest carefully synchronizing words (Q845082): Difference between revisions
From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710525515655 |
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: On two Combinatorial Problems Arising from Automata Theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Theory Is Forever / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algebraic Theory of Automata and Languages / rank | |||
Normal rank | |||
Revision as of 11:19, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound for the length of the shortest carefully synchronizing words |
scientific article |
Statements
A lower bound for the length of the shortest carefully synchronizing words (English)
0 references
5 February 2010
0 references
finite automaton
0 references
partial finite automaton
0 references
synchronizability
0 references
