Search Results for "automata"

Sandspiel is an interactive, browser-based cellular automata simulation game that allows users to experiment with physics-like behaviors using simple elements such as sand, water, fire, and plant matter. Built with Rust compiled to WebAssembly and rendered using WebGL, it achieves high-performance simulation directly in the browser without requiring installation. The project focuses on creative exploration, enabling users to draw elements onto a canvas and observe emergent behaviors as they interact in real time. ...

The goal of this project is to provide a generator for lexical analyzers of maximum computational efficiency and maximum range of applications. This includes the support for Unicode (UTF8, UTF16, ...) and a large variety of other encodings directly and via nested converters such as ICU(tm) and IConv. Sophisticated buffer handling allows to operate on plain file streams, on sockets, or manually fed buffer content. 'Ready-to-build' examples explain related concepts and facilitate practical...

CASUP is a Cellular Automata (CA) library for HPC and supercomputers. It can be used in materials science (microstructure evolution, grain coarsening, fracture etc.), physics (Ising magnetisation) and for many other CA. If you use the library, please reference it as: A. Shterenlikht, L. Margetts, Three-dimensional cellular automata modelling of cleavage propagation across crystal boundaries in polycrystalline microstructures, Proc.

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.

Not working yet. To deal with the Halting Problem, computing and data are navigated using debugger ops: linearForward and treeForward, which navigate an astronomically large bit string where 1 is ( and 0 is ). All pairs are derived from (). For example, true is represented as ((()())()), and false is (()(()())). It appears related to the church encoding of lambda where T chooses first parameter and F chooses second, of a pair. Continuations are nearly finished code and are represented as a...

We aim to develop a transformative computational method for automatic discovery of a set of dynamical rules that best captures both state transition and topological transformation in the data of spatio-temporal evolution of a complex network.

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.

* Model-checking/simulation-checking library for real-time system with dense-time models in C with CRD (Clock-Restriction Diagrams) technology. * Parametric analysis library for linear-hybrid systems in C with HRD (Hybrid-Restriction Diagram) technol

The software resents an executable specification language based on deterministic finite automata, this allows the user to perform tests of word recognition in the state machines that are defined by it. Moreover, it’s possible for the user to assign snippets of code to be executed every transition automaton, these snippets can be described in Lua or PHP programming language. To test that were conducted in the language, was developed a compiler that recognizes words and generates object code.

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.

The fast2armc program translates source code of a counter automata model for FAST(er) tool to the ARMC prolog syntax.

MASyV (Multi-Agent System Visualization) enables one to write agent-based models/cellular automata, eg. in C, visualize them in real time & capture to movie file with MASyVs GUI & message passing lib. Includes examples: Hello World, ants, viral infection

Tools for develop and program design in the style of finite automata

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

Our goal is to develop a full working solver for ATA (with 1 clock) in Python, with MTL to ATA support. The decidability for the emptiness problem was proposed by Lasota and Walukiewicz. The MTL to ATA was proposed by Ouaknine and Worrell.

Automata Based Programming Tool for implementing logic for J2SE, J2EE and Sybmian applications. Consists of Java FSM Framework and Eclipse Plugin parts. Plugin implements UML model editor, visual debugger, validator, compiler and interpreter for Eclipse

RexRex is a Regexp matching engine based on Automata Theory Principles (so-called DFA Engine) Implemented in ANSI C . currently it supports (,),*,+,?,Character classes ([],w,s,..etc) and escaping FWIW Rex is king in Latin;so it's RexKing :)

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

Prenzl!! is a desktop application and a screen saver running artistic cellular automata. The application is based on an Eclipse architecture and the rules can be in native. Our mission is to provide a viewer and an SDK for this kind of art, called CArt.

The Perl Formal Language Toolkit (FLaT), is a set of compatible Perl modules used for investigating regular expressions and finite automata. It is also a goal to create a tool kit, which may be used to create apps with FAs as underlying data structures..

CAML (Cellular Automata Modelling Language) is an XML application for modelling Cellular Automata.

Paxion is a graphical editor for Büchi automata (a special kind of finite state automata), written in Java. The ultimate goal is to provide a graphical frontend for several modelcheckers but it can already be used as a standalone editor of automata.

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.

GraphIL is a graphical editor for the intermediate language, one of the input formalisms of Verics. Verics is a tool for automated verification of Timed Automata and protocols, developed in the Institute of Computer Science of Polish Academy of Sciences.

A C++ library which provides an extensible programming environment for exploring Cellular Automata models. Experiments written using this library can be run on the CAM8 CA supercomputer as well as conventional UNIX based workstations.