Affiliation:
1. Department of Mathematics and Mechanics, Ural State University, 620083 Ekaterinburg, Russia
Abstract
A word w over a finite alphabet Σ is n-collapsing if for an arbitrary DFA [Formula: see text], the inequality |δ(Q, w)| ≤ |Q| - n holds provided that |δ(Q, u)| ≤ |Q| - n for some word u ∈ Σ+(depending on [Formula: see text]). We overview some recent results related to this notion. One of these results implies that the property of being n-collapsing is algorithmically recognizable for any given positive integer n.
Publisher
World Scientific Pub Co Pte Lt
Subject
Computer Science (miscellaneous)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees;International Journal of Foundations of Computer Science;2023-07-14
2. Синхронизация конечных автоматов;Uspekhi Matematicheskikh Nauk;2022
3. Synchronization of finite automata;Russian Mathematical Surveys;2022
4. An algorithm for recognition of n-collapsing words;Theoretical Computer Science;2008-02
5. Synchronizing and Collapsing Words;Milan Journal of Mathematics;2007-09-27