A library to explore regular languages, and their various representations
Inspired by a reading of "Introduction to the Theory of Computation" by Michael Sipser and "Introduction to Automata Theory, Languages, and Computation" by Hopcroft, et al.
The library includes:
- A high-level representation of a regular language, for which membership in the language can be tested, and arbitrary functions for which regular languages are closed over can be performed on. This abstraction can be created from and converted to any support regular language representation
- Implementations of NFAs, DFAs, and regular expressions
- Functions to convert between NFA, DFAs, and regular expressions
- Functions to perform operations that are closed for regular languages, like union, intersection, complement, and more
- A regular language abstraction that can be instantiated using any regular
language representation, have any operation performed on it for which regular
languages are closed, and be converted to any regular language representation
- This effectively allows for performing operations on representations for which that operation may not be easy to perform. For example, taking the complement of a regular expression
- Determining if two DFAs are equivalent
- Most of the regular language operations
- The regular language abstraction
- Supporting more advanced regex operations
- Serializing and deserializing the primary representations to/from JSON
- Improving the types
- Unit tests
- Publishing the package to PyPI
- Regular grammars
- Run with Python 3.10. Because that includes some really nice typing capabilities, and pattern matching
- Create a virtual environment
python3 -m venv venv- Activate the virtual environment
source ./venv/bin/activate- Install the package in editable mode
pip3 install -e .- Import the package
from regular_languages import ...