Zobrazeno 1 - 10
of 259
pro vyhledávání: '"Powerset construction"'
Every language recognized by a non-deterministic finite automaton can be recognized by a deterministic automaton, at the cost of a potential increase of the number of states, which in the worst case can go from n states to 2ⁿ states. In this articl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4fa11efd8cda0aadc031bacda61f8403
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:
Gianfranco Lamperti
Publikováno v:
Software: Practice and Experience. 50:335-367
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c46c8e153442204657c8fe09071d69cf
https://doi.org/10.1002/spe.2776
https://doi.org/10.1002/spe.2776
Publikováno v:
Fuzzy Sets and Systems. 376:152-168
In this paper, we propose a canonization method for fuzzy automata, i.e., a determinization method that is able to return a minimal fuzzy deterministic automaton equivalent to the original fuzzy automaton. The canonization method is derived from the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::add6e44d825fde21aae3d6aec6bcb3ba
https://doi.org/10.1016/j.fss.2019.03.009
https://doi.org/10.1016/j.fss.2019.03.009
Autor:
Michele Dusi, Gianfranco Lamperti
Publikováno v:
Intelligent Decision Technologies ISBN: 9789811559242
KES-IDT
KES-IDT
A translated finite automaton (TFA) results from a translation of a deterministic finite automaton (DFA). A translation is based on a mapping from the alphabet of the DFA to a new alphabet, where each symbol in the original alphabet is substituted wi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c90b64990b71d433ed670507fdd58756
http://hdl.handle.net/11379/532419
http://hdl.handle.net/11379/532419
Autor:
Gianfranco Lamperti, Giovanni Caniato
Publikováno v:
KES
A mutating finite automaton (MFA) is a nondeterministic finite automaton (NFA) which changes its morphology over discrete time by a sequence of mutations, one mutation at each time instant. A mutation involves the insertion and/or removal of a set of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6d9127f6f4e48869417d9eb208c76c30
https://doi.org/10.1016/j.procs.2018.07.209
https://doi.org/10.1016/j.procs.2018.07.209
Autor:
Mirzakhmet Syzdykov
Publikováno v:
Open Computer Science, Vol 7, Iss 1, Pp 24-28 (2017)
In this work we present the algorithms to produce deterministic finite automaton (DFA) for extended operators in regular expressions like intersection, subtraction and complement. The method like “overriding” of the source NFA(NFA not defined) wi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3159cfe7c84fe143f168f068d0417ffa
https://doi.org/10.1515/comp-2017-0004
https://doi.org/10.1515/comp-2017-0004
Publikováno v:
Information Sciences. 402:149-164
Given a strong bimonoid P, we introduce three different behaviors of a weighted finite automaton over P (called a P − valued finite automaton), named the initial object semantics, final object semantics and run semantics. We define four forms for a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::47fc34107e85504c6b736688c23f74ad
https://doi.org/10.1016/j.ins.2017.03.021
https://doi.org/10.1016/j.ins.2017.03.021
Publikováno v:
Bille, P, Gørtz, I L & Skjoldjensen, F R 2017, ' Subsequence automata with default transitions ', Journal of Discrete Algorithms, vol. 44, pp. 48-55 . https://doi.org/10.1016/j.jda.2017.05.001
Let $S$ be a string of length $n$ with characters from an alphabet of size $\sigma$. The \emph{subsequence automaton} of $S$ (often called the \emph{directed acyclic subsequence graph}) is the minimal deterministic finite automaton accepting all subs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b20eeea91c2af2b4dd1660e4cbbd5d87
https://doi.org/10.1016/j.jda.2017.05.001
https://doi.org/10.1016/j.jda.2017.05.001
Autor:
Jincheng Zhong, Shuhui Chen
Publikováno v:
2019 IEEE 5th International Conference on Computer and Communications (ICCC).
Deterministic Finite Automaton (DFA) is widely employed in performing fast regular expression matching for numerous network applications. However, constructing DFA recognizing a set of regular expressions is time-consuming especially when the set is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::51b0da90ef404b99385ce1248e8624dd
https://doi.org/10.1109/iccc47050.2019.9064254
https://doi.org/10.1109/iccc47050.2019.9064254