Search Results for "automata"
Sort By:
Showing 157 open source projects for "automata"
View related business solutions-
HubSpot is an AI-powered customer platform with all the software, integrations, and resources you need to connect your marketing, sales, and customer service. HubSpot's connected platform enables you to grow your business faster by focusing on what matters most: your customers.
-
Engage is a pre-built, intelligent contact center platform that transforms customer service.
-
1
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... -
2
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. Features include bounded and unbounded universes, fast generating algorithms, Lua/Python scripting, and a state-of-the-art pattern collection. -
3
DEVS-Suite Simulator
Component, CA, and CCA models; superdense time, DB repo, testing, etc.
Integrated component-based and cellular automata (CA) Parallel DEVS simulator: https://acims.asu.edu/devs-suite/ OFFERS: 1) synchronized execution & animation, 2) run-time linear/superdense I/O & state trajectories, 3) Action Level Real-Time modeling & simulation, 4) model checking, 5) ABM, 6) CA & composable CA playback, 7) KIB interaction modeling, 8) hierarchical model libraries, 9) Black-Box testing & debugging, 10) PostgreSQL repository, 11) FMU (OpenModelica), 12) OSATE (AADL... -
4
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 -
Deliver a personalized customer experience with every interaction, across every channel, with uContact, net2phone’s cloud contact center solution.
-
5
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.
-
6
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... -
7
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... -
8
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. Roy. Soc. A 471:20150039, DOI: http://dx.doi.org/10.1098/rspa... -
9
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... -
Out-of-the-box scripts. Around-the-clock monitoring. Unmatched automation capabilities. Start doing more with less and exceed service delivery expectations.
-
10
A package for computations with finite automata (rooted tree automorphisms) for the GAP system, http://www.gap-system.org.
-
11
LTL3DRA
LTL to deterministic Rabin automata translator based on LTL3BA
THE PROJECT HAS BEEN MOVED TO GITHUB, FOLLOW https://github.com/xblahoud/ltl3dra LTL3DRA is a translator of a fragment of LTL formulae to deterministic Rabin automata. It is based on the popular tool named LTL3BA written by Tomas Babiak (available at https://sourceforge.net/projects/ltl3ba/). The translation used in LTL3DRA is described in T. Babiak, F. Blahoudek, M. Křetínský, and J. Strejček: Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F,G)-Fragment (2013... -
12
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. -
13
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). -
14
USCB Automata
Project files for scripts
-
15
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. -
16
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
-
17
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] -
18
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. -
19
PyCX now has a new project website at https://github.com/hsayama/PyCX . The following contents are maintained for archival purposes only. ==== 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.
-
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. Springer-Verlag... -
21
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
-
22
physicsmata
API for all possible cellular automata that work same at all angles
Its strange how the "sorted pointers" normalizing makes just about any random function, as long as it connects the inputs to the outputs on some path, vibrate as some nonlinear shape of wave. This could be used as a game interface for evolvable musical instruments or fluid puzzle games. Physicsmata is similar in effect to SmoothLife but simpler and pure Java. The cellular automata API takes a function to run at each point. Its parameters are sums of screen brightness (n color dimensions... -
23
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. -
24
RE2NDEA
Regular Expressions into Non-Deterministic Automata
re2ndea (written in C) This small program was written as a part of the "Automata theory" course. It converts regular expressions into non-deterministic automata. -
25
xorlisp
Bit level lambda continuations and nothing else - Queue automata
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...