Zobrazeno 1 - 10
of 138
pro vyhledávání: '"synchronizing word"'
Autor:
Genda, Attila
En aquest treball s'han investigat numèricament i analíticament les propietats de sincronització de paraules repetides en autòmats finits deterministes. Es presenta un algorisme polinomi O(n^2) per trobar paraules curtes de sincronització basade
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3484::bb17fb1c3f956f9da125e3b6e862e6b1
https://hdl.handle.net/2117/384741
https://hdl.handle.net/2117/384741
Autor:
Hanan Shabana
Publikováno v:
Ural Mathematical Journal, Vol 4, Iss 2 (2018)
We approach the problem of computing a D2-synchronizing word of minimum length for a given nondeterministic automaton via its encoding as an instance of SAT and invoking a SAT solver. In addition, we report some of the experimental results obtained w
Externí odkaz:
https://doaj.org/article/66ea1531bd7a43aebfa5f503ce7e3943
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 19 no. 1, Iss Automata, Logic and Semantics (2017)
A finite deterministic (semi)automaton A = (Q, Σ, δ) is k-compressible if there is some word w ∈ Σ + such that theimage of its state set Q under the natural action of w is reduced by at least k states. Such word w, if it exists, is calleda k-com
Externí odkaz:
https://doaj.org/article/afb41477d6e347789f7008623380789e
Autor:
Ferens, Robert, Szykuła, Marek
A complete deterministic finite (semi)automaton (DFA) with a set of states $Q$ is \emph{completely reachable} if every non-empty subset of $Q$ can be obtained as the image of the action of some word applied to $Q$. The concept of completely reachable
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a2c37923e1ec91180d1dc93901f16034
http://arxiv.org/abs/2208.05956
http://arxiv.org/abs/2208.05956
Autor:
Lucas V. R. Alves, Patrícia N. Pena
Publikováno v:
IFAC-PapersOnLine. 53:10474-10479
Most of the systems are build of components that should stay synchronized for the system to work properly. Usually, the synchronism of these subsystems is maintained through communication and this communication is subject to failures, leading the sys
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c4fd2366b9067888a50e325249c4f6df
https://doi.org/10.1016/j.ifacol.2020.12.2791
https://doi.org/10.1016/j.ifacol.2020.12.2791
Autor:
Lucas V. R. Alves, Patrícia N. Pena
Publikováno v:
IFAC-PapersOnLine. 53:453-458
In modern manufacturing systems, the current state of the system is not always obvious. In many situations, such knowledge is needed to lead the system to a specific state such that a determined task can be started or a maintenance task can be execut
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::66a9bd840df0689086df451eecb723a9
https://doi.org/10.1016/j.ifacol.2021.04.042
https://doi.org/10.1016/j.ifacol.2021.04.042
Autor:
Szykuła, Marek, Zyzik, Adam
A synchronizing word of a deterministic finite complete automaton is a word whose action maps every state to a single one. Finding a shortest or a short synchronizing word is a central computational problem in the theory of synchronizing automata and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::de99e8dde832e8487061d42be75cb9ce
Autor:
Vojtěch Vorel, Adam Roman
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 17 no. 1, Iss Automata, Logic and Semantics (2015)
Automata, Logic and Semantics
Externí odkaz:
https://doaj.org/article/7ebaa8cd95424d2a8a7f47f7b2b5c2cf
Autor:
H. Shabana
Publikováno v:
Ural Mathematical Journal, Vol 4, Iss 2 (2018)
We approach the problem of computing a D2-synchronizing word of minimum length for a given nondeterministic automaton via its encoding as an instance of SAT and invoking a SAT solver. In addition, we report some of the experimental results obtained w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2c9c310af47e4e8027d8494325ed29f3
https://doi.org/10.15826/umj.2018.2.011
https://doi.org/10.15826/umj.2018.2.011
We study synchronizing partial DFAs, which extend the classical concept of synchronizing complete DFAs and are a special case of synchronizing unambiguous NFAs. A partial DFA is called synchronizing if it has a word (called a reset word) whose action
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::22f1a10d8b5c38755ff0e2bda7d2f73d