I was asked to write a Python program to execute regular expressions on strings using an algorithm known as Thompson's construction. In this, I have to build a non-deterministic finite automaton (NFA) from a regular expression, and can use this to check if the regular expression matches any given string text
Autogex is a powerful Java engine for processing Finite State Automata and Regular Expressions. It is a lightweight and extensible library that strictly implements Formal Language Theory to manipulate, convert, and minimize computational models.
Add a description, image, and links to the thompsons-construction topic page so that developers can more easily learn about it.
To associate your repository with the thompsons-construction topic, visit your repo's landing page and select "manage topics."