Deterministic Finite Automata

DFA::Kleene is a Kleenes Algorithm for Deterministic Finite Automata. Calculates the "language" (set of words) accepted (= recognized) by a Deterministic Finite Automaton. SYNOPSIS use DFA::Kleene qw(initialize define_accepting_states define_delta kleene example); use DFA::Kleene...

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.

DFA::Simple is a Perl module to implement simple Discrete Finite Automata. SYNOPSIS my $Obj = new DFA::Simple or my $Obj = new DFA::Simple $Transitions; or my $Obj = new DFA::Simple $Actions, $StateRules; $Obj->Actions = [...]; my $Trans = $LP->Actions; $Obj->StateRules = [...]; my...


Platforms: *nix

The XFA library is a Finite Automata (FA) library to handle tasks like building (programmatically or from regular expressions), converting NFA (Non-deterministic FA) to DFA (Deterministic FA) and reducing FA graphs.The library relies only on the availability of an ANSI C compiler, and in this way...


Platforms: C and C plus plus

Tools for finite automata simulation, minimization and grammar utilities (left recursion removal, context free grammar simplification and transformation to Chomsky Normal Form).


Platforms: Windows, Mac, Linux

FLAT::Legacy::FA::RE is a regular expression base class. SYNOPSIS use FLAT::Legacy::FA::RE; use FLAT::Legacy::FA::NFA; my $re = RE->new(); $re->set_re(a|b|(hi)*); my $nfa = $re->to_nfa(); print $nfa->info(); # see stuff on NFA my $dfa = $nfa->to_dfa(); print $dfa->info(); # see stuff...


Platforms: *nix

QSMM is a recursive acronym for "QSMM State Machine Model". The program tries to interact optimally with external event source represented by deterministic finite automaton. A prototype for request/response interaction mode is also implemented.


Platforms: *nix

GFA Fractal Imager project is a imager which uses a simple visual construction mechanism. Generalized Finite Automata (GFA) Imager is a simple Java Applet which creates fractal images using an intuitive visual representation of finite automata Try clicking in the applet area to the right :...


Platforms: *nix

The EJS Cellular Automata Rules Model shows a spatial lattice which can have any one of a finite number of states and which are updated synchronously in discrete time steps according to a local (nearby neighbor) rule. You can change the lattice size, pick different rules (0 to 255 as classified...


Platforms: Mac

The EJS Cellular Automata (Rule 90) model displays a lattice with any one of a finite number of states which are updated synchronously in discrete time steps according to a local (nearby neighbor) rule. Rule 90 is a specific nearby neighbor rule following the classification scheme developed by...


Platforms: Mac

A library to build and manipulate finite state automata, I/O automata, transducers and rational langagues in Java.


Platforms: Windows, Mac, Linux

This script shows a Finite State Machine (FSM) that can be used for small parsing tasks. The code is quite simple. The bulk of it is comments. In addition to state this FSM also maintains a user defined "something". This "something" is effectively memory, so this FSM could be considered a...


Platforms: Windows, Mac, *nix, Python, BSD Solaris

Uppaal Timed Automata Parser Library (libutap) is the parser library used by UPPAAL..


Platforms: *nix

Cellular::Automata::Wolfram is a Perl module that implements one-dimensional non-totalistic cellular automata as described in Dr. Steven Wolframs, A New Kind of Science, ISBN:1-57955-008-8 SYNOPSIS use Cellular::Automata::Wolfram; my $png_file = shift; my $caw = new...


Platforms: *nix

Free Finite Element Package is a modular collection of C libraries which contain numerical methods required when working with linear and quadratic finite elements in two dimensions. FFEP works on GNU/Linux and is portable to every system where MEML (i.e. LAPACK and BLAS) are available. The goal...


Platforms: *nix

This is a little script that uses Python to generate the cellular automata that Wolfram discusses in his book "A New Kind of Scilfram disquot;.The script uses the Python Imaging Library to render the output, but you could replace this with text or any other method of visualization.


Platforms: Windows, Mac, *nix, Python, BSD Solaris

Simulation of a gaussian pulse propagated in free space through 1000 um, using finite differences.Just run the script and you'll get a surface which is made up of the pulse propagated at 1 um steps.


Platforms: Matlab

The Library is for Finite Transforms such as the Number Theoretic Transform (NTT) and others. Current modules include NTTW for NTTs with high resolution (microsecond) timing, basic array and imaging. The transforms are optimised for performance.


Platforms: Mac

SLFFEA stands for San Le's Free Finite Element Analysis. It is a package of scientific software and graphical user interfaces for use in finite element analysis. It is written in ANSI C by San Le and distributed under the terms of the GNU license.


Platforms: *nix

Software for exploring five cellular automata: q-state Life (a generalization of Conway's Game of Life), the Belousov-Zhabotinsky Reaction, Togetherness, Viral Replication and Diffusion-Limited Aggregation.The documentation provides a complete description of the algorithms used.


Platforms: Windows