Approximation of Reset Thresholds with Greedy Algorithms

DOI10.3233/FI-2016-1357zbMath1368.68228OpenAlexW2507199258MaRDI QIDQ4976394

D. S. Ananichev, Vladimir V. Gusev

Publication date: 28 July 2017

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2016-1357

zbMATH Keywords

approximation algorithmgreedy algorithminapproximabilitysynchronizing wordsynchronizing automatareset threshold

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Approximation algorithms (68W25)

Related Items (6)

Unnamed Item ⋮ Preimage problems for deterministic finite automata ⋮ Complexity of Preimage Problems for Deterministic Finite Automata ⋮ A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices ⋮ Černý's conjecture and the road colouring problem ⋮ Attainable Values of Reset Thresholds

This page was built for publication: Approximation of Reset Thresholds with Greedy Algorithms