CF Query minmal graph DB, programming assignments for the formal languages course in St Petersburg University

Formal Languages and Automata class labs - 1st Year

This project implements a regular expression interpreter. It allows the user to give a regular expression that corresponds to a language, wich will be the solution of a problem. Then, the user can try to write a regular expression that recognizes the same language to solve the problem getting help from different tools available.

Homework for university in 5th sem

𝙵𝙰𝙵 𝙵𝚘𝚛𝚖𝚊𝚕 𝙻𝚊𝚗𝚐𝚞𝚊𝚐𝚎𝚜 ​​𝚊𝚗𝚍 𝙲𝚘𝚖𝚙𝚒𝚕𝚎𝚛 𝙳𝚎𝚜𝚒𝚐𝚗

Collection of labs for compilers course @ McMaster

Volumetry and uniform sampling methods for timed regular expressions.

Regular Expressions to Deterministic Finite Automatons parser, used to obtain the minimum DFA, and also to check which strings are accepted by a given NFA.

Classes to simulate various automatas in Formal Language Theory

Trabalho 1 de Linguagens Formais e Compiladores (INE5421)

🔍 Practice on regular expressions, "Theory of Formal Languages" course at MIPT DIHT 2nd year

This repository contains a Python program for checking the acceptability of strings in a Finite State Machine (FSM). The program allows users to define the FSM by providing the number of states, inputs, transitions, and final states. It then evaluates user-provided strings to determine if they are acceptable within the specified FSM.

CFG to CNM

Implementation of and AFD (Deterministic Finit Automaton) for the Formal Languages and Compilers grade - Computer Engineering @ UEPG

A package to simulate the output of a control system by means of the Chen-Fliess series.

Code dealing with formal languages and finite automata.

👨🏽‍💻👏 Assignment for 'Formal Languages, Automata and Computability' subject about a simulation of Turing Machine

Formal languages course project for sophomore year at HSE SPb

The project for my Bachelor thesis about creating dialogue for video games using formal grammars. The project is using the Expressionist tool by James Ryan