ts-automata

An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.

Python Finite State Machines made easy.

A low level regular expression library that uses deterministic finite automata.

Wayeb is a Complex Event Processing and Forecasting (CEP/F) engine written in Scala.

High performance Trie and Ahocorasick automata (AC automata) Keyword Match & Replace Tool for python. Correct case insensitive implementation!

Functional Meaning Representation and Semantic Parsing Framework

Frame is a markdown language for creating state machines (automata) in Python as well as generating UML documentation.

Parse a text corpus and generate sentences in the same style using context-free grammar combined with a Markov chain.

Rust library for indexing and quickly searching large pretraining corpora

A Talk on Ragalur Expressions