Fun stuffs from my class.

📖 Word Processing in Groups

Tool for manipulating Regular Languages

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.

A Tool for Intersecting Context-Free Grammars

Grammars, automata and regular expressions editor

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

Efficient C++ implementation of a property tester for regular expressions/languages.

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

Finite Automata and Regular Expressions for Regular Languages in Haskell

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

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

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

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.

A Python package to explore regular languages and their representations

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

Parses Formal Regular Expressions and outputs graphs.

Fundamentals of Computing - Learn through simulation

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.

Transforming a regular expression into a nondeterministic automaton, then into a deterministic automaton, and back to a regular expression.