An Extremal Series of Eulerian Synchronizing Automata

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F16%3A10392142" target="_blank" >RIV/00216208:11320/16:10392142 - isvavai.cz</a>

Result on the web

<a href="https://doi.org/10.1007/978-3-662-53132-7_31" target="_blank" >https://doi.org/10.1007/978-3-662-53132-7_31</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-662-53132-7_31" target="_blank" >10.1007/978-3-662-53132-7_31</a>

Result language

angličtina

Original language name

An Extremal Series of Eulerian Synchronizing Automata

Original language description

We present an infinite series of n-state Eulerian automata whose reset words have length at least (n(2) - 3)/2. This improves the current lower bound on the length of shortest reset words in Eulerian automata. We conjecture that (n(2) - 3)/2 also forms an upper bound for this class and we experimentally verify it for small automata by an exhaustive computation.

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

2016

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

DEVELOPMENTS IN LANGUAGE THEORY, DLT 2016

ISBN

978-3-662-53132-7

ISSN

0302-9743

e-ISSN

neuvedeno

Number of pages

13

Pages from-to

380-392

Publisher name

SPRINGER INT PUBLISHING AG

Place of publication

CHAM

Event location

Montreal

Event date

Jul 25, 2016

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

000389721100031