A Fast Algorithm Finding the Shortest Reset Words

DOI10.1007/978-3-642-38768-5_18zbMath1381.68122arXiv1203.2822OpenAlexW3100782362MaRDI QIDQ4925236

Marek Szykuła, Jakub Kowalski, Andrzej P. Kisielewicz

Publication date: 11 June 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

synchronizing wordČerný conjecturesynchronizing automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Random Deterministic Automata ⋮ Fast synchronization of inhomogenous random automata ⋮ Computing the shortest reset words of synchronizing automata

This page was built for publication: A Fast Algorithm Finding the Shortest Reset Words