Synchronizing Automata: Reset Strings and State Complexity
Result description
Dual problem is formulated to the shortest reset word of synchronizing automata. Some preliminary results are presented for slowly synchronizing automata and Kn,m automata.
Keywords
The result's identifiers
Result code in IS VaVaI
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Synchronizing Automata: Reset Strings and State Complexity
Original language description
Dual problem is formulated to the shortest reset word of synchronizing automata. Some preliminary results are presented for slowly synchronizing automata and Kn,m automata.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proc. 13th IEEE International Symposium on Computational Intelligence and Informatics
ISBN
978-1-4673-5204-8
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
391-394
Publisher name
IEEE Publication, Piscataway IEEE Catalog Number CFP1224M
Place of publication
—
Event location
Budapešť, Maďarsko
Event date
Jan 1, 2012
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—
Basic information
Result type
D - Article in proceedings
CEP
IN - Informatics
Year of implementation
2012