scientific article; zbMATH DE number 6257572

zbMath1285.68085arXiv1207.2556MaRDI QIDQ5747408

Grech, Mariusz, Andrzej P. Kisielewicz

Publication date: 14 February 2014

Full work available at URL: https://arxiv.org/abs/1207.2556

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Directed graphs (digraphs), tournaments (05C20)

Related Items (14)

Strongly connected synchronizing automata and the language of minimal reset words ⋮ Unnamed Item ⋮ Strong Inapproximability of the Shortest Reset Word ⋮ Checking Whether an Automaton Is Monotonic Is NP-complete ⋮ Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees ⋮ Complexity of road coloring with prescribed reset words ⋮ Synchronizing sequences for road colored digraphs ⋮ Preimage problems for deterministic finite automata ⋮ On the Interplay Between Černý and Babai’s Conjectures ⋮ Complexity of Preimage Problems for Deterministic Finite Automata ⋮ Černý conjecture for edge-colored digraphs with few junctions ⋮ Complexity of a problem concerning reset words for Eulerian binary automata ⋮ A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number ⋮ An Extremal Series of Eulerian Synchronizing Automata

This page was built for publication: