Java implementation of the CYK algorithm.

Implementation of a pushdown automaton (PDA) in Java for learning purposes

A JavaFX-based tool for visualizing, editing, and minimizing DFAs (Deterministic Finite Automata), enabling users to efficiently create, optimize, and work with state machines in a user-friendly interface.

A simulation of mealy and moore machines.

Theory of Computation | Conversion from NFA to DFA

Finds the minimum DFA (automaton) from a set of sequences in input

My practices and implementation during my studies on computation theory at SBU

Automata Conversions algorithms in Java.

A senior honors thesis developing a Java graphical application for computational automata.

Generate a string from regex using java. Firstly transfrom regex to nfa to dfa then create a new string from regex

A simple tool to convert NDFA(Non-deterministic Finite Automaton)(without Lambda(or Epilson) Transitions) into DFA(Deterministic Finite Automaton), both using JFLAP's simulator file format.

Implementation of 1D cellular automata in Java

Java implementation of a Definite & Indefinite finite automata

To unpack CFG Trees Like {S->XaX|bX ,X->a|c|ac|cb}

Formal Languages and Automata Theory Course

Laboratory works on the course "Automata theory", 3rd year, VI semester

Repository for (simple) finite automata designs.

A text decryption program written for Automata Theory and Formal Languages class.

Lab solutions for Introduction to Theoretical Computer Science ("Uvod u teoriju računarstva") course at FER 2018/19

Complementation of Semi-deterministic Büchi (nested word) automata