Results 251 to 260 of about 1,535,797 (279)

Bin packing problem solution through a deterministic weighted finite automaton

AIP Conference Proceedings, 2016
In this article the solution of Bin Packing problem of one dimension through a weighted finite automaton is presented. Construction of the automaton and its application to solve three different instances, one synthetic data and two benchmarks are presented: N1C1W1_A.BPP belonging to data set Set_1; and BPP13.BPP belonging to hard28.
J. C. Zavala-Díaz, J. Pérez-Ortega, A. Martínez-Rebollar, N. N. Almanza-Ortega, M. Hidalgo-Reyes   +4 more
openaire   +1 more source

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, Guoyin Zhang, Zhou Fang, Jiahui Liu, Xinyu Liu, Fangzhou Li   +5 more
openaire   +1 more source

Intrusion Detection System Based on a Deterministic Finite Automaton for Smart Grid Systems

2018
Smart grid system is a target to many types of network attacks, such as Denial Of Serive (DOS), Man In The Middle (MITM) ... that could compromise users’ privacy and network’s integrity and availability. For this reason we developed a network based intrusion detection system (IDS) that relies on a deterministic finite automaton (DFA) to recognize an ...
Nadia Boumkheld, Mohammed El Koutbi
openaire   +1 more source

Development of Converted Deterministic Finite Automaton of Decision Tree Rules of Student Graduation and Adaptive Learning Environment

Proceedings of the 6th International Conference on Information Technology: IoT and Smart City, 2018
In theory of computation, a deterministic finite automaton (DFA) is a finite state machine that accepts/rejects finite strings of symbols and only produces a unique computation. This study aims to convert the extracted decision tree rules sets from decision tree algorithm and the learning path sequence of the learning management system.
Ace C. Lagman, Melvin A. Ballera, Jennifer O. Contreras, Jennalyn G. Raviz   +3 more
openaire   +2 more sources

Implementation of Equivalence of Deterministic Finite-State Automation and Non-deterministic Finite-State Automaton in Acceptance of Type 3 Languages Using Programming Code

2018
An automaton is used where information and materials are transformed, transmitted, and utilized for performing some processes without direct involvement of human. A finite automaton (both deterministic and non-deterministic) is used to recognize a formal regular language.
null Rinku, Chetan Sharma, Ajay Kumar Rangra, Manish Kumar, Aman Madaan   +4 more
openaire   +1 more source

Quasi-deterministic virtual finite automaton (QDVFA) of order \(s\)

2009
Summary: In this paper, we introduce the notion of Quasi-deterministic Virtual Finite Automaton (QDVFA) of order \((s,t)\) and study the language recognition capabilities of the same.
Jain, A., Lee, J.-S.
openaire   +2 more sources

Stroke-based intelligent character recognition using a deterministic finite automaton

Logic Journal of IGPL, 2015
Darío Álvarez, Ramón Fernández 0001, Lidia Sánchez   +2 more
openaire   +1 more source

The Maya Calendar as a Deterministic Finite Automaton: A Formal Computational Analysis of Temporal Synchronization

This publication presents a formal computational analysis of the Maya calendar, specifically the integrated Tzolk’in (260-day), Haab’ (365-day), and Long Count systems. The calendar is rigorously modeled as a deterministic finite automaton with a finite state space of 18,980 unique configurations (Calendar Round), derived from the synchronization of ...
openaire   +1 more source

Conditions for Minimal Fuzzy Deterministic Finite Automata via Brzozowski's Procedure

IEEE Transactions on Fuzzy Systems, 2018
José Ramon Gonzalez de Mendivil
exaly  

An nlogn algorithm for hyper-minimizing a (minimized) deterministic automaton

Theoretical Computer Science, 2010
Andreas Maletti, Markus Holzer
exaly