One language to be RegExp's Successor. Visually readable and rich, technically safe and extended, naturally scalable, advanced, and optimized

• UpdatedMar 29, 2022
• JavaScript

A python library to manipulate formal languages and various automata

• UpdatedSep 4, 2025
• Python

Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]

• UpdatedApr 23, 2025
• Coq

A Swift library for writing & manipulating patterns for matching on collections.

• UpdatedNov 30, 2021
• Swift

Code for "Learning nominal automata"

• UpdatedOct 18, 2024
• Haskell

A Tool for Intersecting Context-Free Grammars

• UpdatedDec 19, 2017
• C++

Finite Automata and Regular Expressions for Regular Languages in Haskell

• UpdatedJun 2, 2021
• Haskell

Grammars, automata and regular expressions editor

• UpdatedMar 22, 2018
• Python

Active learning tool designed to explore the pumping lemma property for regular language

• UpdatedDec 30, 2024
• Java

A Regular Languages Simulator to help CS students understand and experiment with everything Regular Languages 📕 Includes Regular Expressions (Regexes), DFAs, NFAs, as well as functionality and UI for converting back and forth between them ♻️

• UpdatedOct 1, 2024
• TypeScript

Fundamentals of Computing - Learn through simulation

• UpdatedJan 26, 2023
• TypeScript

Fun stuffs from my class.

• UpdatedApr 24, 2017
• Python

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.

• UpdatedAug 3, 2023
• C++

A proof of concept C++ application for learning regular languages

• UpdatedDec 27, 2022
• C++

Advanced programming and algorithmization in C++ ⚔️

• UpdatedJun 27, 2024
• C++

Simple interpreter for PDA programs (Language for designing and testing pushdown automatas)

• UpdatedJun 19, 2019
• Java

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.

• UpdatedAug 4, 2022
• Python

📖 Word Processing in Groups

• UpdatedSep 22, 2017
• TeX

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.

• UpdatedJul 30, 2024
• Java

Python module for processing finite automata and regular expressions for use in the Theory of Compuation course

• UpdatedSep 26, 2021
• HTML