Native Java implementation of a an deterministic finite automaton.

Implementation Of finite State Machines In JAVA

Projects of Automata and Formal Languages, fourth semester, computer science.

A Basic android calculator which calculates multiple values at single time. The calculation is implemented through Arithmetic Precedence Tree. DFA parser is also used in the project.

Simple interpreter for PDA programs (Language for designing and testing pushdown automatas)

Theory of Computation | Conversion from NFA to DFA

Deterministic Finite Automata parser for my Theory of Computation class.

Compiler/Simulator for Models of Computation

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

Theory of Automata NSU course labs

Solution à l'exercice Bender – Épisode 1 proposé par la plateforme Codingame.

Virtual Pet atau "Hewan Peliharaan Maya" adalah sejenis aplikasi bot yang berperilaku secara maya seperti hewan peliharaan. Virtual Pet bertingkah laku yang dipengaruhi oleh tuannya dan dapat dirancang menggunakan Finite State Automaton (FSA) dengan mesin Deterministic Finite Automaton (DFA) pada Teori Bahasa dan Automata.

Java implementation of DFA(Deterministic Finite Automata) and Turing Machine

A Java program to model a DFA (Deterministic Finite Automaton)

An implementation of multiple concepts and techniques related to the theory of computation and compilers like DFA, NFA, Regular Expressions, Fallback DFA, CFG Left-Recursion Elimination, First and Follow, LL(1) Parsing, Lexical Analysis, and SDD

formal_language_theory_midterm_project_spring_1402

Please read the Design Report.