Double Substring based Classification for Nondeterministic Finite Automata

P  Ezhilarasu    and N  Krishnaraj

doi:10.17485/ijst/2015/v8i26/87161

Article

Double Substring based Classification for Nondeterministic Finite Automata

VIEWS 772
PDF 334

Abstract
Full-Text HTML
Full-Text PDF
How to Cite

Indian Journal of Science and Technology

DOI: 10.17485/ijst/2015/v8i26/87161

Year: 2015, Volume: 8, Issue: 26, Pages: 1-4

Original Article

Double Substring based Classification for Nondeterministic Finite Automata

P. Ezhilarasu^1* and N. Krishnaraj²

¹ Department of Computer Science and Engineering Hindusthan College of Engineering and Technology Coimbatore - 641032, India; [email protected]
² Department of Information Technology, Valliammai Engineering College, Chennai - 603203, India; [email protected]

This work is licensed under a Creative Commons Attribution 4.0 International License.

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 Automata^1,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 machines⁷.
Keywords: Containing Condition, Ending Condition , NFA, Self-Lloop, Starting Condition , Substring