Subset Synchronizability in Eulerian Automata Is NP-Hard

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10392150" target="_blank" >RIV/00216208:11320/14:10392150 - isvavai.cz</a>

Result on the web

<a href="http://ktiml.mff.cuni.cz/~vorel/bib/VO2conf.pdf" target="_blank" >http://ktiml.mff.cuni.cz/~vorel/bib/VO2conf.pdf</a>

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Subset Synchronizability in Eulerian Automata Is NP-Hard

Original language description

We consider the following generalized notion of synchroniz ation: A word is called a reset word of a subset of states of a deterministic finite automaton if it ma ps all states of the set to a unique state. It is known that the minimum length of such words is superpoly nomial in worst cases, namely in a series of substantially nontransitive automata. We prese nt a series of transitive binary automata with a strongly exponential minimum length. This also const itutes a progress in the research of composition sequences initiated by Arto Salomaa, because r eset words of subsets are just a special case of composition sequences. Deciding about the existenc e of a reset word for given automaton and subset is known to be a PSPACE-complete problem, we prove that this holds even if we restrict the problem to transitive binary automata.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

<a href="/en/project/GA14-10799S" target="_blank" >GA14-10799S: Hybercubic, graph and hypergraph structures</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2014

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Černý&apos;s Conjecture and Optimization Problems

ISBN

978-80-7510-122-8

ISSN

—

e-ISSN

neuvedeno

Number of pages

8

Pages from-to

—

Publisher name

Institute of Computer Science, Silesian University in Opava

Place of publication

Opava

Event location

Opava

Event date

Jan 1, 2014

Type of event by nationality

CST - Celostátní akce

UT code for WoS article

—