Active learning tool designed to explore the pumping lemma property for regular language
-
Updated
Oct 5, 2020 - Java
Active learning tool designed to explore the pumping lemma property for regular language
Simple interpreter for PDA programs (Language for designing and testing pushdown automatas)
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
Transforming a regular expression into a nondeterministic automaton, then into a deterministic automaton, and back to a regular expression.
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."