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 +8 more sources
A memory-efficient deterministic finite automaton-based bit-split string matching scheme using pattern uniqueness in deep packet inspection. [PDF]
PLoS One, 2015 This paper proposes a memory-efficient bit-split string matching scheme for deep packet inspection (DPI). When the number of target patterns becomes large, the memory requirements of the string matching engine become a critical issue. The proposed string matching scheme reduces the memory requirements using the uniqueness of the target patterns in the ...
Kim H, Choi KI, Choi SI.
europepmc +8 more sources
DLIQ: A Deterministic Finite Automaton Learning Algorithm through Inverse Queries
Information Technology and Control, 2022 Automaton learning has attained a renewed interest in many interesting areas of software engineering including formal verification, software testing and model inference. An automaton learning algorithm typically learns the regular language of a DFA with the help of queries.
Farah Haneef, Muddassar Azam Sindhu
semanticscholar +4 more sources
A
Expert Systems, 2021 AbstractDue to the high arithmetic complexity and scalability challenges of deep learning, there is a critical need to shift research focus towards energy efficiency. Tsetlin Machines (TMs) are a recent approach to machine learning (ML) that has demonstrated significantly reduced energy compared to neural networks alike, while providing comparable ...
K. Darshana Abeyrathna +7 more
semanticscholar +5 more sources
A Deterministic finite automaton approach to design rule checking for VLSI [PDF]
Proceedings of the nineteenth design automation conference on - DAC '82, 1982 Integrated circuit fabrication technologies place certain restrictions on the relationships with and between mask layers. These "design rules" are intended to describe the class of designs that the fabrication process will correctly implement. The intent of this paper is to describe a general design rule checking algorithm that will take as input the ...
R. Alan Eustace, Amar Mukhopadhyay
semanticscholar +5 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).
Tarik Hajji +3 more
semanticscholar +3 more sources
Neural Networks as Universal Finite-State Machines: A Constructive Deterministic Finite Automaton Theory [PDF]
arXiv.orgWe present a complete theoretical and empirical framework establishing feedforward neural networks as universal finite-state machines (N-FSMs). Our results prove that finite-depth ReLU and threshold networks can exactly simulate deterministic finite automata (DFAs) by unrolling state transitions into depth-wise neural layers, with formal ...
Sahil Rajesh Dhayalkar
semanticscholar +4 more sources
A Novel Multi-step Finite-State Automaton for Arbitrarily Deterministic Tsetlin Machine Learning [PDF]
SGAI Conferences, 2020 Due to the high energy consumption and scalability challenges of deep learning, there is a critical need to shift research focus towards dealing with energy consumption constraints. Tsetlin Machines (TMs) are a recent approach to machine learning that has demonstrated significantly reduced energy usage compared to neural networks alike, while ...
K. Darshana Abeyrathna +6 more
semanticscholar +6 more sources
Construction of a Minimal Deterministic Finite Automaton from a Regular Expression
International Journal of Computer Applications, 2011 This paper describes a method for constructing a minimal deterministic finite automaton (DFA) from a regular expression. It is based on a set of graph grammar rules for combining many graphs (DFA) to obtain another desired graph (DFA). The graph grammar rules are presented in the form of a parsing algorithm that converts a regular expression R into a ...
Sanjay Bhargava, G. N. Purohit
semanticscholar +3 more sources
Precise estimation of the order of local testability of a deterministic finite automaton [PDF]
Workshop on Implementing Automata, 1998 15 ...
A. N. Trahtman
semanticscholar +6 more sources