Double Substring based Classification for Nondeterministic Finite Automata

Abstract

Background/Objectives: To classify Nondeterministic Finite Automata (NFA) using double substring. Methods/Statistical Analysis: The Substring placed at two places preceded or/and followed by the loop placed at the start/intermediate/final states. Findings: The Nondeterministic Finite Automata classified based on double substring into three types. Those are 1. NFA that starts with a substring and ends with a substring, 2. NFA that starts with a substring and contains a substring and 3. NFA that contains a substring and ends with a substring. The previous methods used single, double, and more than double loop to classify Nondeterministic Finite Automata1,6. Application/Improvements: The categorization also applicable to regular expression, and Deterministic Finite Automata (DFA). This concept can be used to design modified ticket vending machines7. Keywords: Containing Condition, Ending Condition , NFA, Self-Lloop, Starting Condition , Substring