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
openalex +3 more sources
The Dirac Equation, Mass and Arithmetic by Permutations of Automaton States [PDF]
The cornerstones of the Cellular Automaton Interpretation of Quantum Mechanics are its underlying ontological states that evolve by permutations. They do not create would-be quantum mechanical superposition states.
Hans-Thomas Elze
doaj +2 more sources
A Novel Multi-step Finite-State Automaton for Arbitrarily Deterministic Tsetlin Machine Learning [PDF]
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.
K. Darshana Abeyrathna +6 more
openalex +3 more sources
A Deterministic finite automaton approach to design rule checking for VLSI [PDF]
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
openalex +3 more sources
Detecting a single fault in a deterministic finite automaton [PDF]
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 Polański, Eryk Lipka
openalex +3 more sources
EMV Cards Vulnerabilities Detection Using Deterministic Finite Automaton
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
openalex +2 more sources
Half-Positional Objectives Recognized by Deterministic B\"uchi Automata [PDF]
In two-player games on graphs, the simplest possible strategies are those that can be implemented without any memory. These are called positional strategies. In this paper, we characterize objectives recognizable by deterministic B\"uchi automata (a
Patricia Bouyer +3 more
doaj +3 more sources
A Predict Deterministic Finite Automaton for Practical Deep Packet Inspection
AbstractDeep packet inspection has become extremely important due to network security. In deep packet inspection, the packet payload is compared against a set of patterns specified as regular expressions. Regular expressions are often implemented as deterministic finite automaton (DFA) for matching in linear time at high network link rates. We proposed
Qiang Wei, Yunzhao Li, Yanjie Chu
openalex +2 more sources
A superpolynomial lower bound for the size of non-deterministic complement of an unambiguous automaton [PDF]
Unambiguous non-deterministic finite automata have intermediate expressive power and succinctness between deterministic and non-deterministic automata.
Mikhail Raskin
openalex +2 more sources
DLIQ: A Deterministic Finite Automaton Learning Algorithm through Inverse Queries
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
openalex +3 more sources

