Černý conjecture for edge-colored digraphs with few junctions

DOI10.1016/j.endm.2016.09.021zbMath1356.05051OpenAlexW2537138782WikidataQ122881531 ScholiaQ122881531MaRDI QIDQ510555

Andrzej P. Kisielewicz, Grech, Mariusz

Publication date: 13 February 2017

Full work available at URL: https://doi.org/10.1016/j.endm.2016.09.021

zbMATH Keywords

junctionsynchronizing automataČerný conjecturecolored digraph

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Synchronizing sequences for road colored digraphs ⋮ Preimage problems for deterministic finite automata

Cites Work

• Synchronizing generalized monotonic automata
• Reset Sequences for Monotonic Automata
• Synchronizing Automata Preserving a Chain of Partial Orders
• An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Černý conjecture for edge-colored digraphs with few junctions