Please use this identifier to cite or link to this item: http://hdl.handle.net/10995/102458
Title: Principal ideal languages and synchronizing automata
Authors: Gusev, V. V.
Maslennikova, M. I.
Pribavkina, E. V.
Issue Date: 2014
Publisher: IOS Press
Citation: Gusev V. V. Principal ideal languages and synchronizing automata / V. V. Gusev, M. I. Maslennikova, E. V. Pribavkina. — DOI 10.3233/FI-2014-1034 // Fundamenta Informaticae. — 2014. — Vol. 132. — Iss. 1. — P. 95-108.
Abstract: We study ideal languages generated by a single word. We provide an algorithm to construct a strongly connected synchronizing automaton for which such a language serves as the language of synchronizing words. Also we present a compact formula to calculate the syntactic complexity of this language.
Keywords: IDEAL LANGUAGE
STRONGLY CONNECTED AUTOMATON
SYNCHRONIZING AUTOMATON
SYNCHRONIZING WORD
SYNTACTIC COMPLEXITY
ALGORITHMS
SYNCHRONIZATION
SYNTACTICS
IDEAL LANGUAGE
STRONGLY CONNECTED AUTOMATONS
SYNCHRONIZING AUTOMATA
SYNCHRONIZING WORDS
SYNTACTIC COMPLEXITY
AUTOMATA THEORY
URI: http://hdl.handle.net/10995/102458
Access: info:eu-repo/semantics/openAccess
SCOPUS ID: 84901774572
PURE ID: 414011
1ba994cd-0f1a-4413-8051-a1b54dc5f91d
ISSN: 1692968
DOI: 10.3233/FI-2014-1034
Appears in Collections:Научные публикации, проиндексированные в SCOPUS и WoS CC

Files in This Item:
File Description SizeFormat 
2-s2.0-84901774572.pdf207,67 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.