IEEE

SI-DFA: Sub-expression integrated Deterministic Finite Automata for Deep Packet Inspection

Abstract: Finite automata is widely used for Deep Packet Inspection (DPI) of network traffic. Two types of automata employed for this purpose are Non-deterministic Finite Automata (NFA) and ...
IEEE

Design of an Automatic Washing Machine Control System using Deterministic Finite Automata

Abstract: A Deterministic Finite Automaton (DFA) is a theoretical model of computation used to design and analyze the behavior of systems with a finite number of states, where each state transitions ...
GitHub

A web-based project that converts regular expressions into Deterministic Finite Automata (DFA), Context-Free Grammars (CFG), and Pushdown Automata (PDA)

A web-based project that converts regular expressions into Deterministic Finite Automata (DFA), Context-Free Grammars (CFG), and Pushdown Automata (PDA) ...
Nature

Automata Learning and Formal Verification

Automata learning and formal verification represent converging fields aimed at enhancing the reliability and safety of complex systems. Automata learning involves the algorithmic inference of system ...
Scientific Research Publishing

On Some Systems of Word Equations for Automata ()

1 Faculty of Computational Mathematics and Cybernetics, Shenzhen MSU-BIT University, Shenzhen, China. 2 Algebra and Discrete Mathematics Department, Southern Federal University, Rostov-on-Don, Russian ...