A Pipelined Non-Deterministic Finite Automaton-Based String Matching Scheme Using Merged State Transitions in an FPGA. [PDF]
PLoS ONE, 2016 This paper proposes a pipelined non-deterministic finite automaton (NFA)-based string matching scheme using field programmable gate array (FPGA) implementation.
HyunJin Kim, Kang-Il Choi
doaj +6 more sources
Precise estimation of the order of local testability of a deterministic finite automaton [PDF]
Lecture Notes in Computer Science, 1998 15 ...
A N Trahtman
exaly +3 more sources
EMV Cards Vulnerabilities Detection Using Deterministic Finite Automaton
Procedia Computer Science, 2018 Abstract Europay-MasterCard-Visa (EMV) standard aims to improve the security and reliability of smartcards. The main concern of this contribution is to detect vulnerabilities in an EMV transaction between terminal and EMV card. In this paper, we propose a new methodology for vulnerabilities detection based on Deterministic finite automaton (DFA).
Mostafa Azizi +2 more
exaly +2 more sources
Ambiguity Hierarchy of Regular Infinite Tree Languages [PDF]
Logical Methods in Computer Science, 2021 An automaton is unambiguous if for every input it has at most one accepting computation. An automaton is k-ambiguous (for k > 0) if for every input it has at most k accepting computations. An automaton is boundedly ambiguous if it is k-ambiguous for some
Alexander Rabinovich, Doron Tiferet
doaj +1 more source
Adaptive Non-linear Pattern Matching Automata [PDF]
Logical Methods in Computer Science, 2021 Efficient pattern matching is fundamental for practical term rewrite engines. By preprocessing the given patterns into a finite deterministic automaton the matching patterns can be decided in a single traversal of the relevant parts of the input term ...
Rick Erkens, Maurice Laveaux
doaj +1 more source
Finitely generated subgroups of free groups as formal languages and their cogrowth [PDF]
Groups, Complexity, Cryptology, 2021 For finitely generated subgroups $H$ of a free group $F_m$ of finite rank $m$, we study the language $L_H$ of reduced words that represent $H$ which is a regular language.
Arman Darbinyan +2 more
doaj +1 more source
Token Games and History-Deterministic Quantitative-Automata [PDF]
Logical Methods in Computer Science, 2023 A nondeterministic automaton is history-deterministic if its nondeterminism can be resolved by only considering the prefix of the word read so far. Due to their good compositional properties, history-deterministic automata are useful in solving games and
Udi Boker, Karoliina Lehtinen
doaj +1 more source
Detecting a single fault in a deterministic finite automaton
CoRR, 2021 Given a deterministic finite automaton and its implementation with at most one single fault, that we can test on a set of inputs, we provide an algorithm to find a test set that guarantees finding whether the fault exists.
Artur Polanski, Eryk Lipka
openaire +3 more sources
DETERMINISTIC FINITE AUTOMATA LEARNING USING COUNTEREXAMPLE GUIDED ABSTRACTION REFINEMENT [PDF]
Научно-технический вестник информационных технологий, механики и оптики, 2020 Subject of Research. The paper studies minimum-sized deterministic finite automata inferring problem. A hybrid method is developed and implemented reducing the given problem to Boolean satisfiability (SAT) technique and at the same time applying a ...
Ilya T. Zakirzyanov
doaj +1 more source
Using the past for resolving the future
Frontiers in Computer Science, 2023 Nondeterminism models an ability to see the future: An automaton with an infinite look ahead can successfully resolve its nondeterministic choices. An automaton is history deterministic (HD) if it can successfully resolve its nondeterministic choices in ...
Orna Kupferman
doaj +1 more source