Results 231 to 240 of about 51,114 (288)
Representation of a Regular Language By Means of a Finite Deterministic Automaton
Representation of a Regular Language By Means of a Finite Deterministic Automatonopenaire
A Compact and Secure Access Control Solution Based on a Deterministic Finite Automaton
2023 International Conference Automatics and Informatics (ICAI), 2023 Access control systems are critical in ensuring the security of various facilities, ranging from residential buildings to corporate offices and government institutions.
Akbota Kulzhanova +4 more
semanticscholar +3 more sources
A regular expression matching using non-deterministic finite automaton
Eighth ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE 2010), 2010 This paper shows an implementation of CANSCID (Combined Architecture for Stream Categorization and Intrusion Detection). To satisfy the required system throughput, the packet assembler and the regular expression matching are implemented by the dedicated hardware. On the other hand, the counting of matching results and the system control are implemented
Hiroki Nakahara +2 more
semanticscholar +3 more sources
A Parallel Aho-Corasick Algorithm with Non-deterministic Finite Automaton Based on OpenMP
2015 Seventh International Conference on Advanced Communication and Networking (ACN), 2015 Existing typical algorithms of string matching are too difficult for taking advantage of multicore platforms. OpenMP (Open Multi-Processing) supports multiprocessing application programming interface with shared memory. We introduce a parallel Aho-Corasick algorithm based on OpenMP for shared memory, which exploits the non-deterministic finite ...
Jiaxing Qu +5 more
semanticscholar +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A Deterministic Finite Automaton for Faster Protein Hit Detection in BLAST
Journal of Computational Biology, 2006BLAST is the most popular bioinformatics tool and is used to run millions of queries each day. However, evaluating such queries is slow, taking typically minutes on modern workstations. Therefore, continuing evolution of BLAST--by improving its algorithms and optimizations--is essential to improve search times in the face of exponentially increasing ...
Michael, Cameron +2 more
openaire +3 more sources
2012 IEEE Network Operations and Management Symposium, 2012
Deep Packet Inspection (DPI) systems have been becoming an important element in traffic measurement ever since port-based classification was deemed no longer appropriate, due to protocol tunneling and misuses of well-defined ports. Current DPI systems express application signatures using regular expressions and it is usual to perform pattern matching ...
R. Antonello +4 more
openaire +2 more sources
Deep Packet Inspection (DPI) systems have been becoming an important element in traffic measurement ever since port-based classification was deemed no longer appropriate, due to protocol tunneling and misuses of well-defined ports. Current DPI systems express application signatures using regular expressions and it is usual to perform pattern matching ...
R. Antonello +4 more
openaire +2 more sources
Artificial Life and Robotics, 2015
It is well known that routing problems are recast as a binary integer linear programming in overhead hoist transport (OHT) vehicle systems. Two kinds of discrete-time state space models of the routing problem are proposed in this paper that simplifies the constraints and binary variables.
Ryosuke Nakamura +4 more
openaire +2 more sources
It is well known that routing problems are recast as a binary integer linear programming in overhead hoist transport (OHT) vehicle systems. Two kinds of discrete-time state space models of the routing problem are proposed in this paper that simplifies the constraints and binary variables.
Ryosuke Nakamura +4 more
openaire +2 more sources
The Minimal Deterministic Finite-State Automaton for a Finite Language
Finite-State Techniques, 2019A fundamental task in natural language processing is the efficient representation of lexica. From a computational viewpoint, lexica need to be represented in a way directly supporting fast access to entries, and minimizing space requirements. A standard method is to represent lexica as minimal deterministic (classical) finite-state automata.
openaire +2 more sources
Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing
2009 12th Euromicro Conference on Digital System Design, Architectures, Methods and Tools, 2009As the speed of current computer networks increases, it is necessary to protect networks by security systems such as firewalls and Intrusion Detection Systems operating at multigigabit speeds. Pattern matching is the time-critical operation of current IDS on multigigabit networks.
Jan Kastil, Jan Korenek, Ondrej Lengal
openaire +2 more sources