Zobrazeno 1 - 10
of 2 953
pro vyhledávání: '"deterministic finite automaton"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Energies, Vol 15, Iss 4, p 1517 (2022)
This paper demonstrates the effectiveness of using anomaly detection in cyclic communication as a method aimed at protecting industrial installations from steganographic communication and a wide range of cyberattacks. The analysis was performed for a
Externí odkaz:
https://doaj.org/article/7075edf6e7d144a1bfde9ab8fbc99618
Publikováno v:
IEEE Transactions on Automatic Control. 67:2816-2828
In this paper we study a security problem of protecting secrets in discrete-event systems modeled by deterministic finite automata. In the system some states are defined as secrets, each of which is associated with a security level. The problem is to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3767acbb2b1bcb702efcbdc29b1446d3
https://doi.org/10.1109/tac.2021.3091438
https://doi.org/10.1109/tac.2021.3091438
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Oliver R. Goodenough, Mark D. Flood
Publikováno v:
Artificial Intelligence and Law. 30:391-416
We show that the fundamental legal structure of a well-written financial contract follows a state-transition logic that can be formalized mathematically as a finite-state machine (specifically, a deterministic finite automaton or DFA). The automaton
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::81f5baca2f3cff0c4dfd473ab3527186
https://doi.org/10.1007/s10506-021-09300-9
https://doi.org/10.1007/s10506-021-09300-9
Publikováno v:
JURNAL ILMIAH INFORMATIKA. 9:100-104
Each ministry always has a budget for official travel, especially for the daily money given to personnel who travel in exchange for daily expenses. With the current pendemi need to be held an application system that can reduce contact when handling o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::408fdf524d165e253d8712fdec22d9b4
https://doi.org/10.33884/jif.v9i02.3770
https://doi.org/10.33884/jif.v9i02.3770
Publikováno v:
Neurocomputing. 454:34-44
This paper investigates the reconstructibility of switched Boolean control networks (SBCNs). Several new types of definition about reconstructibility are proposed where the existence and arbitrariness of the switching signal and the input sequence ar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d0bbd837ac7d6d00dad817f7c543046b
https://doi.org/10.1016/j.neucom.2021.05.019
https://doi.org/10.1016/j.neucom.2021.05.019
Autor:
Xiangru Xu, Behcet Ackmese
Publikováno v:
IEEE Transactions on Automatic Control. 66:3386-3392
This article studies the constrained switching (linear) system which is a discrete-time switched linear system whose switching sequences are constrained by a deterministic finite automaton. The stability of a constrained switching system is character
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::288f103317fd7f148834d410dc8a4a01
https://doi.org/10.1109/tac.2020.3020580
https://doi.org/10.1109/tac.2020.3020580
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
Publikováno v:
Theoretical Computer Science. 864:92-102
The recently introduced one-way jumping automata are strictly more powerful than classical finite automata (FA) while maintaining decidability in most of the important cases. We investigate the extension of the new processing mode to two-way determin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2e5bb8cbe1fbb1d592d6ab6a4b5a0afe
https://doi.org/10.1016/j.tcs.2021.02.030
https://doi.org/10.1016/j.tcs.2021.02.030