 |
|
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper) Automata transformations of prefix decidable and decidable by Buchi superwords N. N. Korneeva Kazan (Volga Region) Federal University, 18 Kremlyovskaya str., Kazan, 420008 Russia Abstract: We show that the set of prefix decidable superwords is closed under finite automata and asynchronous automata transformations. We prove that structures of degrees of finite automata and asynchronous automata transformations contain an atom which consists of prefix decidable superwords with undecidable monadic theory (or undecidable by Buchi). Also we prove that the structure of degrees of asynchronous automata transformations contains an atom which consists of superwords with decidable monadic theory (decidable by Buchi). Keywords: superword, prefix decidability, decidability by Buchi, monadic theory, automata transformation, degrees, atom.
 Full text:
PDF file (216 kB)
References:
PDF file
HTML file
English version: Russian Mathematics (Izvestiya VUZ. Matematika), 2016, 60:7,  Bibliographic databases:  
UDC: 510.53 Received: 18.12.2014 Citation: N. N. Korneeva, “Automata transformations of prefix decidable and decidable by Buchi superwords”, Izv. Vyssh. Uchebn. Zaved. Mat., 2016, no. 7, 
Citation in format AMSBIB
\Bibitem{Kor16}Linking options:
Citing articles on Google Scholar: Russian citations, English citations Related articles on Google Scholar: Russian articles, English articles This publication is cited in the following articles:
|
|
||||||||||||||||||||||||||||||||||||||||||||||||||
|
|
Contact us: |
 Terms of Use
|
Registration |
Logotypes |
|