A Haskell library to manipulate context-free grammars and generate random sentences.
-
Updated
Apr 7, 2017 - Haskell
A Haskell library to manipulate context-free grammars and generate random sentences.
Homework for university in 5th sem
𝙵𝙰𝙵 𝙵𝚘𝚛𝚖𝚊𝚕 𝙻𝚊𝚗𝚐𝚞𝚊𝚐𝚎𝚜 𝚊𝚗𝚍 𝙲𝚘𝚖𝚙𝚒𝚕𝚎𝚛 𝙳𝚎𝚜𝚒𝚐𝚗
Automatix is software for experimenting with formal languages topics like AFD and AFnD
This repo includes most of the assignments of ceng department.
An automata simulator written in Java, supporting Moore, Mealy, TM, DFA, NFA, DPDA, NPDA, CFG
Formal Languages and Automata / Limbaje Formale și Automate / Y1S2
Program to convert regexes to finite automata and vice versa.
Программная реализация простого конечного автомата
CF Query minmal graph DB, programming assignments for the formal languages course in St Petersburg University
Projects for the Formal Languages and Automata class in C++.
Formal Languages and Automata class labs - 1st Year
Projekt z przedmiotu Języki formalne i kompilatory
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.
Extension of JFLAP. Provides command line interface, automaton and words generation and JSON results. Written in Kotlin.
Formal Languages and Automata Theory Course Term Project
Computer Theory - Challenge: Automata recognition analysis.
Add a description, image, and links to the formal-languages topic page so that developers can more easily learn about it.
To associate your repository with the formal-languages topic, visit your repo's landing page and select "manage topics."