Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Issue title: Russian-Finnish Symposium in Discrete Mathematics
Article type: Research Article
Authors: Gusev, Vladimir V. | Maslennikova, Marina I. | Pribavkina, Elena V.
Affiliations: Institute of Mathematics and Computer Science, Ural Federal University, Lenina st. 51, Ekaterinburg 620083, Russia. vl.gusev@gmail.com, maslennikova.marina@gmail.com, elena.pribavkina@usu.ru
Note: [] Address for correspondence: Ural Federal University, 620083, Lenina st. 51, Ekaterinburg, Russia
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, synchronizing automaton, synchronizing word, strongly connected automaton, syntactic complexity
DOI: 10.3233/FI-2014-1034
Journal: Fundamenta Informaticae, vol. 132, no. 1, pp. 95-108, 2014
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl