Completely Reachable Automata: An Interplay between Automata, Graphs, and Trees
Электронный научный архив УРФУ
Информация об архиве | Просмотр оригинала| Поле | Значение | |
| Заглавие |
Completely Reachable Automata: An Interplay between Automata, Graphs, and Trees
|
|
| Автор |
Bondar, E. A.
Casas, D. Volkov, M. V. |
|
| Тематика |
COMPLETE REACHABILITY
DETERMINISTIC FINITE AUTOMATON STRONGLY CONNECTED GRAPH TREE |
|
| Описание |
A deterministic finite automaton in which every non-empty set of states occurs as the image of the whole state set under the action of a suitable input word is called completely reachable. We characterize such automata in terms of graphs and trees. © 2023 World Scientific Publishing Company.
Ministry of Education and Science of the Russian Federation, Minobrnauka: FEUZ-2023-0022 The authors were supported by the Ministry of Science and Higher Education of the Russian Federation, project FEUZ-2023-0022. |
|
| Дата |
2024-04-05T16:28:44Z
2024-04-05T16:28:44Z 2023 |
|
| Тип |
Article
Journal article (info:eu-repo/semantics/article) |info:eu-repo/semantics/submittedVersion |
|
| Идентификатор |
Bondar, E, Casas, D & Volkov, M 2023, 'Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees', International Journal of Foundations of Computer Science, Том. 34, № 06, стр. 655-690. https://doi.org/10.1142/S0129054123450053
Bondar, E., Casas, D., & Volkov, M. (2023). Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees. International Journal of Foundations of Computer Science, 34(06), 655-690. https://doi.org/10.1142/S0129054123450053 0129-0541 Final All Open Access, Green https://www.scopus.com/inward/record.uri?eid=2-s2.0-85165913218&doi=10.1142%2fS0129054123450053&partnerID=40&md5=5e9a43261bff6838cb0c8edd86ff49ea https://arxiv.org/pdf/2201.05075 http://elar.urfu.ru/handle/10995/130666 10.1142/S0129054123450053 85165913218 001031479800001 |
|
| Язык |
en
|
|
| Права |
Open access (info:eu-repo/semantics/openAccess)
|
|
| Формат |
application/pdf
|
|
| Издатель |
World Scientific
|
|
| Источник |
International Journal of Foundations of Computer Science
International Journal of Foundations of Computer Science |
|