An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
-
Updated
Jun 6, 2024 - Rust
An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
Python suite for working with discrete event systems
A Python library for simulating finite automata, pushdown automata, and Turing machines
🎉The Sonic UIAutomation Driver Core. Sonic UI自动化Driver核心。
The jBPT code library is a compendium of technologies that support research on design, execution, and evaluation of business processes. The library offers a broad range of basis analysis and utility functionality and, due to its open publishing model, can easily be extended.
Transforming a regular expression into a nondeterministic automaton, then into a deterministic automaton, and back to a regular expression.
A collection of cellular automata built using pygame
A simplistic programming language interpreter to Python to help students grasp finite automata theory programmatically and with a computed graph through visualization libraries.
An esoteric programming language based on Turing Machines
A compiler written in typescript
Allows users to create (deterministic) pushdown automata
Regular Expressions and Lexing with DFAs
Basic GUI to demo the Game of Life with a variety of rule sets
Add a description, image, and links to the automaton topic page so that developers can more easily learn about it.
To associate your repository with the automaton topic, visit your repo's landing page and select "manage topics."