1. Use Thompson algorithm to convert the regular expression to NFA 2. Use the subset construct to convert NFA to DFA 3. Minimize DFA to MFA 4. Use MFA to match strings

A little toolbox that provides detector and converter for DFA machines

Theory of Computation | Conversion from NFA to DFA

The aim of this project is to design and implement a library allowing to generate and represent finite state machine also know as finite automaton. The library will also implement algorithms to perform operations that are specific to finite state automaton : Determination, Minimization, Complementary, Elimination of ***ε*** transitions, etc

Converts a given regular expression into a NFA(Thompson's construction) then converts that NFA to a DFA(Subset construction)

This repository contains the projects assigned as a course work for CS410-Automata Theory and Formal Languages at Özyeğin University.

Laboratorio B Diseño de Lenguajes de Programación

一个可爱的、(可能)高效的、支持大部分Flex语法的一个Java词法分析器

A little toolbox that provides detector and converter for DFA machines

Small program that generates a transition function from nondeterministic finite automation to deterministic finite automation

This repository holds my submissions for our Automata Theory and Formal Languages class. The first project converts NFAs to DFAs, the second one converts CFGs to Chomsky Normal Form and the last one is a Turing Machine.

Implementation of fully-functioned finite automata (DFA/NFA), also include schematically implementation

A Theory of Computation mini project in progress using Java and JavaFX GUI.

A Java program that can emulate various computational models

make shift automaton to regex converter