UKZN Computer Science Theory of Computation 3rd year project.

Assignments for the course CSD303 Theory Of Computation

Implement algorithms for fragments of XPath queries.

A basic implementation of regex.

👨‍🎓🖥 A set of compilers problem sets.

Build an NFA from a given reguler expression and then Convert it into a DFA. Buld a DFA from a given regular expression directly

Converts a given NFA to DFA

Java implementation of a Definite & Indefinite finite automata

A repository with a maven package for building state machines (NFAs, DFAs etc.)

Java program that converts regular expression to DFA.

Theory of Computation | Conversion from NFA to DFA

Translate regular expression to NFA map picture（正规式构造NFA图片）

automata machines implemented in Core JAVA.

This is automaton.

A little toolbox that provides detector and converter for DFA machines

NFA simulation

计算机理论基础上机实验 1.非确定性有穷自动机 2.下推自动机 3.图灵机

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