Python module (C extension and plain python) implementing Aho-Corasick algorithm
-
Updated
Dec 17, 2025 - C
An automaton is a relatively self-operating machine designed to automatically follow a sequence of operations.
The term has long been commonly associated with automated puppets that resemble moving humans or animals, built to impress and/or to entertain people.
Python module (C extension and plain python) implementing Aho-Corasick algorithm
C Library of Aho-Corasick Algorithm based on Coordinate Hash Trie
this project aims at facilitating the use of automats
This project is a Lexical Analyzer (Scanner) implemented in C, designed to tokenize a simple programming language. It processes an input string (source code) and identifies valid tokens such as keywords, identifiers, numbers, operators, and punctuation marks. The analyzer is based on a Deterministic Finite Automaton (DFA).
PASCAL subset compiler. The grammar is included. a sample txt source file are also included.
An abstract deterministic finite automaton implementation in C.
Coleção com vários programas que utilizam expressões regulares.
[PT] Analisadores léxicos para disciplina de Compiladores.
A C-based tool for simulating Deterministic Finite Automata. It reads DFA specifications from text files, validates determinism, and processes input strings to determine acceptance based on defined states and transitions.
An automaton has been designed to identify the words *estudiantes*, *escuela*, *rencor*, *rifles*, *crimen*, and *matanza* within a given text. Upon identification, it generates a detailed report that includes the frequency of each word and their respective positions within the text.
A fast C implementation of ECAs
Terminal simulation of cellular automata
A simulator for Deterministic Pushdown Automaton (configurable from plain txt file).
Práctica I de la asignatura Traductores de Lenguajes de Programación. Autómata Finito Determinista Traductor.