Černý conjecture for edge-colored digraphs with few junctions
type: Item
instance of: scholarly article
title: Černý conjecture for edge-colored digraphs with few junctions
zbMATH Open document ID: 1356.05051
author: Andrzej Kisielewicz
author: Mariusz Grech
publication date: 2017-02-13T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6683942
zbMATH Keywords: Černý conjecture
zbMATH Keywords: synchronizing automata
zbMATH Keywords: colored digraph
zbMATH Keywords: junction
MaRDI profile type: Publication
full work available at URL: j.endm.2016.09.021
OpenAlex ID: W2537138782
Wikidata QID: Q122881531
cites work: Q4452055
cites work: Synchronizing generalized monotonic automata
cites work: Q5509690
cites work: Reset Sequences for Monotonic Automata
cites work: Q5747408
cites work: Q4779162
cites work: An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture
cites work: Q5387708
cites work: Synchronizing Automata Preserving a Chain of Partial Orders
DOI: 10.1016/J.ENDM.2016.09.021
description: scientific article; zbMATH DE number 6683942