Скачать или смотреть NON-DETERMINISTIC FINITE AUTOMATA WITH Ε-TRANSITIONSWITH DETERMINISTIC FINITE AUTOMATON CONVERSION

By:
Dungog, Kirk Elizer
Gardose, Jupril Brent
Alunan, Chardin

This project, titled “Non-Deterministic Finite Automaton (NFA) with Epsilon Transitions and DFA Conversion,” showcases the implementation of an automata simulation that accepts strings starting with “b” and ending with “ab.” Created by Kirk Elizer Dungog, Jupril Brent Gardose, and Chardin Alunan from the University of Negros Occidental – Recoletos, College of Information Technology, the program demonstrates the process of simulating an NFA with ε-transitions and converting it into an equivalent DFA using the subset construction algorithm. Through Python programming, it visualizes the core concepts of Automata Theory, including epsilon-closure, NFA simulation, and transition tables. The system validates input strings, performs conversion to DFA when accepted, and outputs detailed five-tuple definitions and transition tables. This project bridges theoretical computer science and practical coding, offering an educational insight into how machines recognize regular languages through formal computation. #AutomataTheory #NFA #DFA #EpsilonTransition #PythonProgramming #CompilerDesign #ComputerScience