A Python package to explore regular languages and their representations
-
Updated
Nov 4, 2022 - Python
A Python package to explore regular languages and their representations
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.
Tool for manipulating Regular Languages
Parses Formal Regular Expressions and outputs graphs.
Group project for the course Functional Programming (2023/24) at the University of Amsterdam
Prácticas relacionadas a la teoría del lenguaje, gramáticas, AFD, AFN y una máquina de Turing que realiza una suma de 2 números binarios en lenguaje C.
Transforming a regular expression into a nondeterministic automaton, then into a deterministic automaton, and back to a regular expression.
Efficient C++ implementation of a property tester for regular expressions/languages.
A proof of concept C++ application for learning regular languages
Implementation of an algorithm that enables finding the minimal deterministic finite automaton that accepts the intersection or union of languages defined by a pair of finite automata.
Library for defining and working with abstract regular expressions that support strings/sequences with elements of any symbol type, with an emphasis on supporting scenarios in which it is necessary to work with regular expressions as abstract mathematical objects.
📖 Word Processing in Groups
Python module for processing finite automata and regular expressions for use in the Theory of Compuation course
Advanced programming and algorithmization in C++ ⚔️
Simple interpreter for PDA programs (Language for designing and testing pushdown automatas)
Fundamentals of Computing - Learn through simulation
Active learning tool designed to explore the pumping lemma property for regular language
A Tool for Intersecting Context-Free Grammars
A Swift library for writing & manipulating patterns for matching on collections.
Add a description, image, and links to the regular-languages topic page so that developers can more easily learn about it.
To associate your repository with the regular-languages topic, visit your repo's landing page and select "manage topics."