Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata

Result code in IS VaVaI

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

Result on the web

<a href="http://link.springer.com/chapter/10.1007/978-3-319-04921-2_47" target="_blank" >http://link.springer.com/chapter/10.1007/978-3-319-04921-2_47</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-319-04921-2_47" target="_blank" >10.1007/978-3-319-04921-2_47</a>

Result language

angličtina

Original language name

Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata

Original language description

A word is called a reset word for a deterministic finite automaton if it maps all states of the automaton to one state. Deciding about the existence of a reset word of given length for a given automaton is known to be a NP-complete problem. We prove thatit remains NP-complete even if restricted on Eulerian automata over the binary alphabet, as it has been conjectured by Martyugin (2011).

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

IN - Informatics

OECD FORD branch

—

Project

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

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

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

Language and Automata Theory and Applications

ISBN

978-3-642-00981-5

ISSN

—

e-ISSN

—

Number of pages

12

Pages from-to

576-587

Publisher name

Springer International Publishing

Place of publication

Switzerland

Event location

Madrid, Španělsko

Event date

Mar 10, 2014

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—