Synchronizing random automata on a 4-letter alphabet

DOI10.1007/s10958-013-1396-4zbMath1276.68099OpenAlexW1995739160MaRDI QIDQ376130

E. S. Skvortsov, Yu. I. Zaks

Publication date: 4 November 2013

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10995/27455

Mathematics Subject Classification ID

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

Related Items (2)

On the Probability of Being Synchronizable ⋮ Černý's conjecture and the road colouring problem

Cites Work

• Synchronizing automata with a letter of deficiency 2
• Synchronizing Automata and the Černý Conjecture
• Slowly Synchronizing Automata and Digraphs
• On two Combinatorial Problems Arising from Automata Theory
• Experimental Study of the Shortest Reset Word of Random Automata
• Unnamed Item
• Unnamed Item

This page was built for publication: Synchronizing random automata on a 4-letter alphabet