Minimal elements for the base b representations of the prime numbers > b for the subsequence ordering, for 2 ≤ b ≤ 36
-
Updated
Jun 11, 2024 - C++
Minimal elements for the base b representations of the prime numbers > b for the subsequence ordering, for 2 ≤ b ≤ 36
Project done for formal languages and compilers class
A place for automata
Easiest-ever formal methods language! Designed for developers crafting distributed systems, microservices, and cloud applications
Материалите ми за упражнения по "Езици, автомати и изчислимост"
Limbaje Formale și Automate / Y1S2
A python library to manipulate formal languages and various automata
Sito web del corso di "Linguaggi e traduttori" @ UniMI
Ce repository contient l'implémentation d'automates finis non-déterministe (AFN) en langage C.
Transforming a regular expression into a nondeterministic automaton, then into a deterministic automaton, and back to a regular expression.
Лабораторные работы по курсу "Теория Формальных Языков"
first-order logic and set theory
Текстовый редактор с функциями языкового процессора (курсовая работа по теории формальных языков и компиляторов (ТФЯиК) за 6 семестр)
A set of tools for analyzing languages via logic and automata
Laboratory Works done during LFM (Formal Languages and Automata) Course at TUM
Useful tools for people interested in mathematics and computer science (with a focus on the latter)
The PML analyzer is an open source API providing a simple DSL to build a description of the architecture of your chip based on the PHYLOG Modelling Language (PML).
Generates random text based on context-free grammars defined in BNF
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."