Zobrazeno 1 - 10
of 173
pro vyhledávání: '"Nondeterministic finite automaton with ε-moves"'
Publikováno v:
International Journal of Foundations of Computer Science. 28:195-210
Many nondeterminism measures for finite automata have been studied in the literature. The tree width of an NFA (nondeterministic finite automaton) counts the number of leaves of computation trees as a function of input length. The trace of an NFA is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ef8d8522f24032637ab401e92dab9823
https://doi.org/10.1142/s0129054117500137
https://doi.org/10.1142/s0129054117500137
Autor:
Hitoshi Furusawa
Publikováno v:
Theoretical Computer Science. 673:19-29
This paper provides a definition of uniformly continuous relations between uniform spaces and studies relationships with continuous relations between topological spaces associated with the uniform spaces. Using the notion of uniform continuity, we gi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::997cbcaef386c97e0f93bb7014b385a5
https://doi.org/10.1016/j.tcs.2017.02.004
https://doi.org/10.1016/j.tcs.2017.02.004
Autor:
Yukihiro Maruyama
Publikováno v:
Journal of the Operations Research Society of Japan. 60:136-155
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0a0365c5b451f9f5993566c3ddfa703d
https://doi.org/10.15807/jorsj.60.136
https://doi.org/10.15807/jorsj.60.136
Autor:
Eric Torng, Alex X. Liu
Publikováno v:
IEEE/ACM Transactions on Networking. 24:2400-2415
Regular expression (RegEx) matching, the core operation of intrusion detection and prevention systems, remains a fundamentally challenging problem. A desired RegEx matching scheme should satisfy four requirements: deterministic finite state automata
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::de97f33934e92c365a6f79a0fa67b303
https://doi.org/10.1109/tnet.2016.2533605
https://doi.org/10.1109/tnet.2016.2533605
Autor:
Tomasz Jastrzab
Publikováno v:
ICCS
The paper discusses the problem of the induction of a minimal nondeterministic finite automaton (NFA) consistent with a given set of examples and counterexamples. The main contribution of the paper is the proposal of an efficient parallel algorithm t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7f140b198e76aa92b76f65dabd6a4546
https://doi.org/10.1016/j.procs.2016.05.318
https://doi.org/10.1016/j.procs.2016.05.318
Autor:
Nina Yevtushenko, Anton D. Ermakov
Publikováno v:
Труды Института системного программирования РАН, Vol 28, Iss 3, Pp 123-144 (2018)
The derivation of checking sequences for Finite State Machines (FSMs) has a long history. There are many papers devoted to deriving a checking sequence that can distinguish a complete deterministic specification FSM from any non-equivalent FSM with t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0fe134d2776a025c3ece78e387e47ef6
https://doi.org/10.15514/ispras-2016-28(3)-8
https://doi.org/10.15514/ispras-2016-28(3)-8
Publikováno v:
Journal of Discrete Mathematical Sciences and Cryptography. 18:717-726
We construct the syntactic nondeterministic monoid associated with a subset L of a nondeterministic monoid M. It is the quotient of M by the greatest nondeterministic congruence∼L on M saturating L and is characterized by the classical universal pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b0ba0b9527a90ef64e1d217cc79c3233
https://doi.org/10.1080/09720529.2014.943462
https://doi.org/10.1080/09720529.2014.943462
Autor:
Sheng-De Wang, Chien-Chi Chen
Publikováno v:
Microprocessors and Microsystems. 39:122-134
Display Omitted A hybrid finite automaton is proposed with deterministic and nondeterministic parts.The hybrid FA is capable of inspecting multiple characters in parallel.The space required by the finite automata is efficient when scales up.The trans
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ad2eb85b570a016769073b0ae1e87595
https://doi.org/10.1016/j.micpro.2015.01.003
https://doi.org/10.1016/j.micpro.2015.01.003
Publikováno v:
EWDTS
Proceedings EWDTS 2017 : 15th IEEE East-West Design & Test Symposium
EWDTS 2017 : 15th IEEE East-West Design & Test Symposium
EWDTS 2017 : 15th IEEE East-West Design & Test Symposium, Sep 2017, Novi Sad, Serbia. pp.1-4, ⟨10.1109/EWDTS.2017.8110091⟩
Proceedings EWDTS 2017 : 15th IEEE East-West Design & Test Symposium
EWDTS 2017 : 15th IEEE East-West Design & Test Symposium
EWDTS 2017 : 15th IEEE East-West Design & Test Symposium, Sep 2017, Novi Sad, Serbia. pp.1-4, ⟨10.1109/EWDTS.2017.8110091⟩
International audience; The paper presents a Finite State Machine (FSM) based approach for deriving tests with reduced complexity, under the White Box testing assumption where all the faulty implementations are explicitly enumerated. The specificatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2bd9a32f6e4cc8f708a53b30d0ea177e
https://doi.org/10.1109/ewdts.2017.8110091
https://doi.org/10.1109/ewdts.2017.8110091
Publikováno v:
IEEE/ACM Transactions on Networking. 22:1701-1714
Network intrusion detection and prevention systems commonly use regular expression (RE) signatures to represent individual security threats. While the corresponding deterministic finite state automata (DFA) for any one RE is typically small, the DFA
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d160f3df78cad046a6df90955ac3d9e5
https://doi.org/10.1109/tnet.2014.2309014
https://doi.org/10.1109/tnet.2014.2309014