Search Results for "finite automata"

This program compiles regular expressions (regexes) written in the modified ECMAScript regex grammar into modular nondeterministic finite automata suitable for hardware acceleration. This was originally an extended re-implementation of the "front-end" part in the following paper: https://www.computer.org/csdl/proceedings/reconfig/2008/3474/00/3474a073-abs.html It has since grown to include conversion of a set of NFAs to a DFA; compilation of NFAs to instruction suitable for simulation; and compilation of a DFA to hash-based data structures for a simulator.

A reworking in C++ of KBMAG. A package and C++ library for computing automatic structures and confluent rewriting system for group and coset rewriting systems, and for computing with finite state automata

A graphical tool for designing finite state machines and exporting them to Hardware Description Languages, such as VHDL, AHDL, Verilog, or Ragel/SMC files for C, C++, Objective-C, Java, Python, PHP, Perl, Lua code generation.

Tautomaton is a C++11 -template library for deterministic (DFA) and non-deterministic finite automata (NFA). It supports regular expressions and efficient input matching of multiple regexps simultaneously. The library comes with a somewhat grep-like command-line tool for showcasing these features.

Automata editor is a vector editor for drawing finite automata according to VauCanSon-G format with tools for working with finite automata such as basic algorithms, exporting transition table to LaTeX format and automata work simulation.

DFA library is a regular expression library capable of the classic RE syntax (i.e. - without any perl extension). Unlike many other libraries with similar functionality, a deterministic finite automata (DFA) is used. DFA was formerly called npcre, wh

This is a smilator for automata. Discrete Finite, Push-Down and Client-Server. The automata is input as a language.