scientific article; zbMATH DE number 6432461

zbMath1326.68178arXiv1403.4749MaRDI QIDQ5249241

Adam Roman, Vojtěch Vorel

Publication date: 30 April 2015

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

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

zbMATH Keywords

road coloring problemparameterized complexitysynchronizing wordreset wordsynchronizing automataČerný conjecture

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (5)

Complexity of road coloring with prescribed reset words ⋮ A multi-parameter analysis of hard problems on deterministic finite automata ⋮ On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata ⋮ Černý's conjecture and the road colouring problem ⋮ Synchronizing series-parallel deterministic finite automata with loops and related problems

This page was built for publication: