Search Results for "automata"
Sort By:
Showing 157 open source projects for "automata"
View related business solutions-
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
Demo Series - Small Business Backup By VeeamWatch this on-demand demo series and learn how to protect your Microsoft 365 data with clear, simple, actionable steps that are easy to implement for businesses of all sizes.
-
1
Automaton
The first AI that can earn its own existence, replicate, and evolve
...The project is particularly useful in educational contexts, where visualizing or testing automata behavior helps reinforce concepts such as deterministic and nondeterministic machines. Developers can also use it as a foundation for research prototypes involving parsing, pattern recognition, or language processing. Overall, Automaton bridges the gap between abstract theory and practical implementation by providing a structured and extensible codebase for automata experimentation. -
2
Sandspiel
Creative cellular automata browser game
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. ... -
3
Golly
For exploring cellular automata like Conway's Game of Life.
A cross-platform application for exploring Conway's Game of Life and many other types of cellular automata. -
4
XWizard
XWizard Online Informatics Toolbox
XWizard is a free (web) tool for the automatic visualization, manipulation and PDF generation of many types of objects from theoretical computer science (such as Turing machines, push-down and finite automata, Chomsky grammars etc.). A broad range of algorithms can be applied to the objects, producing intuitive and customizable views. XWizard is well-suited for students’ self-studies, and it is powerfull in aiding teachers at the creation of course material such as exercises (the X in XWizard stands for “eXercise” – and also for “anything”). -
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
5
DEVS-Suite Simulator
Component, CA, and CCA models; superdense time, ETL DB, testing, etc.
Integrated component-based and cellular automata (CA) Parallel DEVS simulator. Version: 8.0 [Aug `26], 7.0 [Jan `23], 6.1 [Apr. `21], 6 [Sep. `20] , 5 [Jul. `19], 4 [Mar. `18], 3 [Apr. `15], 2.1 [Feb. `09], 2 [`03] See PVM: Visual Persistent Hierarchical Component-based Modeler (https://acims.asu.edu/persistent-visual-modeler/ ) and CoSMoSim: hierarchical visual modeling, database model repository, families of models, statecharts, partial-code generation for XML/DEVS-Suite models (https://acims.asu.edu/software/cosmos/). -
6
py_automata
Virtual machines communicating over a virtual network.
By using virtual machines, known as workcells, to communicate with other virtual machines over a virtual network, creating complex event driven programs becomes very simple. For example, the USB port interface is completely autonomous and doesn't have an API. Instead, it interacts with other workcells by receiving three request messages, 'Read', 'Write' and 'Query' and transmitting 'Read' and 'Write' status messages. This is based on the industrial automation programming model where complex... -
7
CART
Reversible cellular automata
Reversible and irreversible cellular automata simulator for Windows and Linux. May use MCell *.dll and Golly https://sourceforge.net/projects/golly *.tree and *.rle files. Adapted for work with generalizations of reversible second-order cellular automata discussed in http://arxiv.org/abs/1311.4297 -
8
Algorithms Math Models
MATLAB implementations of algorithms
...The repository gathers implementations and case studies across many topics commonly used in contest solutions: optimization (linear, integer, goal and nonlinear programming), heuristic and metaheuristic methods (simulated annealing, genetic algorithms, immune algorithms), neural networks and time-series methods, interpolation and regression, graph theory, cellular automata, grey systems, fuzzy models, partial/ordinary differential equations, and multivariate analysis, among others. The codebase is organized into topic folders (e.g., HeuristicAlgorithm, IntegerProgramming, NeuralNetwork, TimeSeries) and includes dozens of worked examples and links to textbook/source materials that the author used to assemble the collection. -
9
TATOWA for tree automata to word automata is "D" package for tree automata minimization. Its principal is to transform a given tree automata to a word automata. The minimization of the later coincides with the minimization of the first one.
-
Train ML Models With SQL You Already KnowBuild and deploy ML models using familiar SQL. Automate data prep with built-in Gemini. Query 1 TB and store 10 GB free monthly.
-
10
LaPath
Learning Automata algorithm for the shortest path problem.
...Heuristics offer lower complexity in expense of accuracy. There are many use cases where the lower accuracy is acceptable in return of lower consumption of computing resources. Learning Automata (LA) are adaptive mechanisms requiring feedback from the executing environment to converge to certain states. In the context of network routing, LA residing at intermediate nodes along a path, exploit feedback from the destination node for reducing, e.g., path's length. According to topology’s resources like the node and edge numbers, the proper number of iterations must be used. ... -
11
Lexical Analyzer Generator Quex
Generator of lexical analyzers in C and C++. Unicode Supported.
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... -
12
CASUP
Cellular Automata library for SUPercomputers (CASUP)
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. -
13
RegexToNFA
Compiles regular expressions into modular NFA
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. -
14
A package for computations with finite automata (rooted tree automorphisms) for the GAP system, http://www.gap-system.org.
-
15
LTL3DRA
LTL to deterministic Rabin automata translator based on LTL3BA
...Tested with buddy 2.4. The benchmark used in "Comparison of LTL to Deterministic Rabin Automata Translators" paper published on LPAR19 can be found in Files/LPAR19-benchmarks (https://sourceforge.net/projects/ltl3dra/files/LPAR19-benchmarks/). -
16
CodeConics
CodeConics is a C# lexer/parser/syntax tree generatior
CodeConics is simple, intuitive, easy to use and debug code-manipulation solution, that is grammar independent and recursion based, as opposed to other DFA(Deterministic Finite-state Automata) based solutions. -
17
CoSMoSim
Visual & persistent families of models for CA, DEVS, and Statecharts
CoSMoSim offers an integrated framework for model development, simulation, & experimentation. Its unified logical, visual, and persistence framework supports specifying families of parallel CA, DEVS, Statecharts, and XML-Schema models (see DEVS-Suite simulator). -
18
AutoSim
A free automata simulator that simulates DFA/NFA/DPDA/NPDA/STM
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. -
19
lifescript
A language for creating cellular automata. Created with Java and ANTLR
An open-source language for creating cellular automata. Developed using Java and ANTLR. Originally created as a final project for a programming language design and implementation course, it was later updated under the supervision of Dr. Lutz Hamel. Usage: # From within the lifescript folder java lifescript [source file] -
20
LTL3BA
Translator of LTL formulae to Büchi automata based on LTL2BA
LTL3BA is a translator of LTL formulae to Büchi automata. It is based on the popular tool named LTL2BA written by Denis Oddoux and Paul Gastin (available at http://www.lsv.ens-cachan.fr/~gastin/ltl2ba/). LTL3BA further improves LTL2BA's performance. Most modifications are described in the paper: T. Babiak, M. Křetínský, V. Řehák, and J. Strejček: LTL to Büchi Automata Translation: Fast and More Deterministic, in Proceedings of TACAS 2012, volume 7214 of LNCS, pages 95-109. ... -
21
...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
-
22
.... ==== The PyCX Project aims to develop an online repository of simple, crude, yet easy-to-understand Python sample codes for dynamic complex systems simulations, including iterative maps, cellular automata, dynamical networks and agent-based models.
-
23
USCB Automata
Project files for scripts
-
24
Interactive graphics software for Cellular Automata, Random Boolean Networks, and multi-value Discrete Dynamical Networks -- space-time patterns and basins of attraction -- to study emergence, complexity, neural and genetic networks. www.ddlab.org
-
25
Finite-Automata
convert finite automata
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.
