Search Results for "automata"
Sort By:
Showing 30 open source projects for "automata"
View related business solutions-
Gen AI apps are built with MongoDB AtlasMongoDB Atlas provides built-in vector search and a flexible document model so developers can build, scale, and run gen AI apps without stitching together multiple databases. From LLM integration to semantic search, Atlas simplifies your AI architecture—and it’s free to get started.
-
La version gratuite d'Auth0 s'enrichit !Vous l'avez demandé, nous l'avons fait ! Les versions gratuite et payante d'Auth0 incluent des options qui vous permettent de développer, déployer et faire évoluer vos applications en toute sécurité. Utilisez Auth0 dès maintenant pour découvrir tous ses avantages.
-
1
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.">
-
2
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...">
-
3
LaPath
Learning Automata algorithm for the shortest path problem.
The shortest path problem is solved by many methods. 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... -
4
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... -
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
5
A reworking in C++ of KBMAG. 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
-
6
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. Springer-Verlag... -
7
Qfsm
A graphical Finite State Machine (FSM) designer.
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. -
8
ASTL Automata Standard Template Library (Vincent Le Maout - Dominique Revuz) is a set of generic and efficient C++ components for automata manipulation.
-
9
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.
-
Powering the best of the internet | FastlyEnsure your websites, applications and services can effortlessly handle the demands of your users with Fastly. Fastly’s portfolio is designed to be highly performant, personalized and secure while seamlessly scaling to support your growth.
-
10
Cellular Automata
Explore Cellular Automata
Do experiments to extend knowledge of cellular automata stuff -
11
Automata editor
automata editor
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. -
12
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
-
13
Ouroborus is an artificial life framework for mobile agents on a background of cellular automata. It can be used to teach and research topics such as population genetics, ecology and evolution. The demo includes a curses view and live Csound audio.
-
14
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
-
15
Poga is software for processing of formal languages, especially for processing automata and grammars. It has modular architecture, it is programmed in C++ and it doesn't have a GUI (it has CLI).
-
16
This software can simulate heat transfer in solid heterogenous materia using cellular automata. There are two different simulation methods and several test model implemented at the moment. It is also possible to define boundary conditions.
-
17
-
18
3D cellular automata modelling software for large general purpose simulations. Uses custom scripts for rules and can distribute processing over several machines.
-
19
This is a smilator for automata. Discrete Finite, Push-Down and Client-Server. The automata is input as a language.
-
20
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.
-
21
HCELL is a C++ library for simulation and analysis of one-dimensional cellular automata, both determinisitic and probabilistic.
-
22
-
23
-
24
Cellumat3D is a tool for simulating and exploring 3D cellular automata. The simulated universe is effectively unbound and visualized using OpenGL. Currently 2-state automata similar to Conway's 2D "Game of Life" with customizable rulesets are supported.
-
25
A lightweight and fast implementation of Conway\'s Game of Life and related cellular automata. It includes a pattern viewer running X Windows and a Python module intended to help in designing complex patterns.