Deterministic Finite Automata 1.0

DFA in Security & Privacy \ Firewalls

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 Deterministic Finite Automata 1.0 License - GNU Library or Lesser General Public License version 2.0 (LGPLv2)


   
 
Related Software

Finite Automata Tool New University of Innsbruck  Miscellaneous

Finite Automata Tool, otherwise known as FAT is a tool that manages to implement and illustrate various algorithms on deterministic and non-deterministic finite automata. All algorithms are visualized where one can either let the algorithms run automatically or in a step-by-step mode. The...

tautomaton 1.0 Tautomaton  Science

Tautomaton is a C++ -template library for deterministic (DFA) and non-deterministic finite automata (NFA). It supports regular expressions and efficient input matching of multiple regexps simultaneously. tautomaton 1.0 License - MIT License

GNFA to RegExp 1.0 Gnfa2re  Misc. Dev. Tools

This program allows you to specify a Deterministic Finite Automata, Nondeterministic Finite Automata, or Generalized NFA and will return a regular expression which recognizes the same language as the FA you described. GNFA to RegExp 1.0 License - GNU General Public License (GPL)

NFA2DFA New Sharafat Ibn Mollah Mosharraf  Misc. Dev. Tools

NFA2DFA is a Java based application that allows you to convert text expressions into NFA and DFA formats. NFA stands for Non-Deterministic Finite Automata, whereas DFA means Deterministic Finite Automata. Both are the basic states of parsing. You can manually enter the name of the states and the...

jFAST - the Finite Automata Simulator 1.2 jfast-fsm-sim.sourceforge.net  Parenting Tools

jFAST is a simple finite automata (FA) graphical simulation utility; it is designed to feature simple mechanisms for creating, editing, and simulating FA. jFAST is ideal for use by students, instructors, and self-guided explorers alike.

javaFSM 1.0.0 Alpha Dimitri Papaioannou  Misc. Dev. Tools

javaFSM is built as an accessible and useful implementation of a few Finite Automata in Java. The project was mainly designed for academic purpose but can also be used to describe state transition diagrams in a business application. The code base is small and easy-to-use.

VSE - Visual Sentences Engine 1.0 vs-engine.sourceforge.net  Science

VSE - Visual Sentence Engine. A SVG-based engine for drawing and evaluating visual sentences for generic visual languages. Support a web-based GUI. Actually support DFA (Deterministic Finite Automata) as typical visual language. Required Adobe SVGViewer.

libnadfa 1.0 Libnadfa  Misc. Dev. Tools

Proyect aim is to develop a library which allow the management of very large dictionaries very efficiently using, for this purpose, numbered deterministic acyclic finite automata. libnadfa 1.0 License - GNU General Public License version 3.0 (GPLv3)

cavy 1.0 Cavy  Misc. Dev. Tools

Cavy is a tool that generates C-source codes for simple deterministic finite state automata from a definition file, which utilizes a syntax similar to Bison grammar. The generated source code is system-neutral and library-independent and thus simplifies porting of the generated software. cavy...

JFLAP 7.0 Susan H. Rodger  Teaching Tools

JFLAP is software for experimenting with formal languages topics including nondeterministic finite automata, nondeterministic pushdown automata, multi-tape Turing machines, several types of grammars, parsing, and L-systems. In addition to constructing and testing examples for these, JFLAP allows...