A lower bound for the length of the shortest carefully synchronizing words (Q845082): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Pavel Martyugin / rank | |||
Property / author | |||
Property / author: Pavel Martyugin / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
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 | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.3103/s1066369x10010056 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2054252811 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 12:10, 30 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