title   
  

Complexities of some problems related to synchronizing, nonsynchronizing and monotonic automata

Türker, Uraz Cengiz and Yenigün, Hüsnü (2014) Complexities of some problems related to synchronizing, nonsynchronizing and monotonic automata. (Accepted/In Press)

WarningThere is a more recent version of this item available.

Full text not available from this repository.

Abstract

In this study, we first introduce several problems related to finding reset words for deterministic finite automata, and present motivations for these problems for practical applications in areas such as robotics and bio-engineering. We then analyse computational complexities of these problems. Second, we consider monotonic and partially specified automata. Monotonicity is known to be a feature simplyfing the synchronizability problems. On the other hand for partially specified automata, synchronizability problems are known to be harder than the completely specified automata. We investigate the complexity of some synchronizability problems for automata that are both monotonic and partially specified. We show that checking the existence, computing one, and computing a shortest reset word for a monotonic partially specified automaton is NP-hard. We also show that finding a reset word that synchronizes $\mathcal{K}$ number of states (or maximum number of states) of a given monotonic non-synchronizable automaton to a given set of states is NP-hard.

Item Type:Article
Subjects:Q Science > QA Mathematics > QA076 Computer software
ID Code:24483
Deposited By:Hüsnü Yenigün
Deposited On:28 Nov 2014 22:31
Last Modified:18 Nov 2015 15:52

Available Versions of this Item

Repository Staff Only: item control page