scientific article; zbMATH DE number 6292581

zbMath1286.68295MaRDI QIDQ5414550

No author found.

Publication date: 6 May 2014

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/1456/0.html

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

zbMATH Keywords

random DFAČerný problemsynchronizing DFAWormald's theorem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (8)

Synchronizing random automata on a 4-letter alphabet ⋮ A quadratic algorithm for road coloring ⋮ Circular automata synchronize with high probability ⋮ On the Probability of Being Synchronizable ⋮ Experimental Study of the Shortest Reset Word of Random Automata ⋮ COMPAS - A Computing Package for Synchronization ⋮ Černý's conjecture and the road colouring problem ⋮ Synchronizing Almost-Group Automata

This page was built for publication: