formal_language_theory_midterm_project_spring_1402

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

Please read the Design Report.

This project aims to simplify regular expressions using unique identifiers for equivalent expressions. It integrates various representations of regular languages and provides efficient algorithms for simplification and conversion. The system includes an additional layer for optimizing expression size using a Union-Find structure.

A DFA simulator to visualize DFA constructions

A generator of service-oriented applications for demonstration purposes that are based on Deterministic Finite Automata (abbreviated DFA).

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.

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

Automata Simulator: DFA & NFA

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

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

Compiler/Simulator for Models of Computation

Native Java implementation of a an deterministic finite automaton.

Implementation Of finite State Machines In JAVA

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

Theory of Automata NSU course labs

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.

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