On a conjecture by Carpi and D'Alessandro
type: Item
instance of: scholarly article
zbMATH Open document ID: 1252.68163
DOI: 10.1142/S012905411100888X
author: Mikhail V. Berlinkov
published in: International Journal of Foundations of Computer Science
publication date: 2012-08-29T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6073865
zbMATH Keywords: synchronizing automata
zbMATH Keywords: Černý conjecture
zbMATH Keywords: extension method
MaRDI profile type: Publication
Wikidata QID: Q123240419
cites work: A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONE-CLUSTER AUTOMATA
cites work: A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata
cites work: The Synchronization Problem for Strongly Transitive Automata
cites work: Strongly transitive automata and the Černý conjecture
cites work: Reset Sequences for Monotonic Automata
cites work: An extremal problem for two families of sets
cites work: Synchronizing finite automata on Eulerian digraphs.
cites work: Reset words for commutative and solvable automata
cites work: The Averaging Trick and the Černý Conjecture
cites work: Synchronizing Automata and the Černý Conjecture
title: On a conjecture by Carpi and D'Alessandro
description: scientific article; zbMATH DE number 6073865