Search Results for "nfa dfa"

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...

AutoSim is a free automata simulator for students and educators. Written in Java, it is a command-line based utility that runs on any OS that supports Java. With AutoSim, you can not only determine the final state or stack/tape contents, you can also trace through the execution states as well, from the initial to the final states. The latest version of AutoSim is 1.0, and it currently supports DFAs, NFAs, DPDAs, NPDAs, as well as Standard Turing Machines.

This software can convert epsilon-NFA to NFA to DFA or NFA to DFA and minimization of DFA It works in the windows linux and mac.

This API provides an easy way of dealing with regular expressions. It provides DFA and NFA implementations, so if you need performance or group captures and analysis, both solutions are available.

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.

visualFSA is a small tool which lets you construct NFAs/DFAs [(non)deterministic finite automata]. It offers some common algorithms which can be applied to that automatons, like converting NFA -> DFA, word problem, accepted language etc.

GUI application that can be used for generate graph representation for any given DFA or NFA table and check weather strings are accepted or rejected by finite automata.

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.

Finite automation，developed by java and it's open source.input the RE,can produce RG,NFA,DFA,MinDFA,Draw the corresponding transition diagram and show the details of transition.

A C library, providing comfortable APIs for a wide range of Finite State Abstract Machines (NFA, DFA, FST, Bimachines, etc). Implements most of the classical algorithms in the field.

This project is a fork of RE2, hosted at http://code.google.com/p/re2/. Why a fork? The reason for the fork is to address a need for use cases which conflict with one of RE2's central missions, which is to be lightweight. DFAlib's API's will change to reflect the needs of use cases which require features that have been rejected at RE2. DFAlib retains the New BSD license of RE2 and credit the original authors of RE2 as forming the basis of this new project. The central innovation DFAlib...