|
Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2016, Number 7, Pages 55–65
(Mi ivm9134)
|
|
|
|
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.
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, 55–65; Russian Math. (Iz. VUZ), 60:7 (2016), 47–55
Linking options:
https://www.mathnet.ru/eng/ivm9134 https://www.mathnet.ru/eng/ivm/y2016/i7/p55
|
Statistics & downloads: |
Abstract page: | 210 | Full-text PDF : | 38 | References: | 38 | First page: | 5 |
|