# Complexity of problems concerning reset words for some partial cases of automata

### Abstract

A word w is called a reset word for a deterministic finite automaton A if it maps all states of A to one state. A word w is called a compressing to M states for a deterministic finite automaton A if it maps all states of A to at most M states. We consider several subclasses of automata: aperiodic, D-trivial, monotonic, partially monotonic automata and automata with a zero state. For these subclasses we study the computational complexity of the following problems. Does there exist a reset word for a given automaton? Does there exist a reset word of given length for a given automaton? What is the length of the shortest reset word for a given automaton? Moreover, we consider complexity of the same problems for compressing words.### Downloads

Download data is not yet available.

Published

2009-01-01

How to Cite

*Acta Cybernetica*,

*19*(2), 517-536. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3780

Issue

Section

Regular articles