Search Results for "automata"
Sort By:
Showing 78 open source projects for "automata"
View related business solutions-
Define and Deliver Comprehensive Cybersecurity Services. Security threats continue to grow, and your clients are most likely at risk. Small- to medium-sized businesses (SMBs) are targeted by 64% of all cyberattacks, and 62% of them admit lacking in-house expertise to deal with security issues. Now technology solution providers (TSPs) are a prime target. Enter ConnectWise Cybersecurity Management (formerly ConnectWise Fortify) — the advanced cybersecurity solution you need to deliver the managed detection and response protection your clients require. Whether you’re talking to prospects or clients, we provide you with the right insights and data to support your cybersecurity conversation. From client-facing reports to technical guidance, we reduce the noise by guiding you through what’s really needed to demonstrate the value of enhanced strategy.
-
Chat with your business data with Looker. More than just a modern business intelligence platform, you can turn to Looker for self-service or governed BI, build your own custom applications with trusted metrics, or even bring Looker modeling to your existing BI environment.
-
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. Features include bounded and unbounded universes, fast generating algorithms, Lua/Python scripting, and a state-of-the-art pattern collection. -
2
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... -
3
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 -
4
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... -
ConnectWise PSA (formerly Manage) allows you to stop working in separate systems, and helps you build a more profitable business. No more duplicate data entries, inefficient employees, manual invoices, and the inability to accurately track client service issues. Get a behind the scenes look into the award-winning PSA that automates processes for each area of business: sales, help desk, support, finance, and HR.
-
5
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... -
6
A package for computations with finite automata (rooted tree automorphisms) for the GAP system, http://www.gap-system.org.
-
7
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... -
8
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). -
9
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
-
Whether natural disaster, cyberattack, or plain-old human error, data can disappear in the blink of an eye. ConnectWise BCDR (formerly Recover) delivers reliable and secure backup and disaster recovery backed by powerful automation and a 24/7 NOC to get your clients back to work in minutes, not days.
-
10
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... -
11
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... -
12
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. -
13
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... -
14
Visual Integer Factor
Puzzle game demonstrating whats so hard about binary integer factoring
VisualIntFactor will be an interactive educational and scientific tool demonstrating multiply, factor, conversion between unary counting and binary integers, all in the same grid of hexagons. This grid is based on pascals triangle, which is a 1d cellular automata that calculates (X choose Y) factorials by each cell being the sum of the 2 cells upleft and upright. Draw a binary integer from a cell going upright, then explore the allowed transforms which may lead you to a factored state in 2... -
15
-
16
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.
-
17
Bellman
Conway's Life pattern searcher
Bellman, named after the character in Lewis Carroll's The Hunting of the Snark, is a program for searching for catalytic interactions in Conway's Game of Life and potentially other similar cellular automata. Results are derived directly from the automaton's evolution rule, not generated from a list of candidate catalysts as with previous searchers. -
18
ASTL Automata Standard Template Library (Vincent Le Maout - Dominique Revuz) is a set of generic and efficient C++ components for automata manipulation.
-
19
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.
-
20
* 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
-
21
Automata is a Tool to simultaneously control several Instruments for Test and Measurement. Automata allows Hardware designers to develop and execute various testcases. Automata support instruments that are connected to a LAN. the GUI is a web browser
-
22
The fast2armc program translates source code of a counter automata model for FAST(er) tool to the ARMC prolog syntax.
-
23
SemaRule Navigator is an Integrated Suite of Open-Source and Free-License Software, placing Semantic and Text Analysis Technologies in the toolbox of Researchers, Students, and Enterprises.
-
24
visualFSA is a small tool which lets you construct NFAs/DFAs [(non)deterministic finite automata]. It offers some common algorithms which can be applied to that automatons, like converting NFA -> DFA, word problem, accepted language etc.
-
25
Celeste Cellular Automaton Simulator
A tiny and very simple cellular automata simulator. Abandoned, ignore.
Celeste is a tiny and simple Cellular Automata simulator written in Java. It is a command line application that writes an image of each simulation step. Celeste was designed to run Conway's Game of Life but other rulesets can be implemented as well. It is released under the extremely permissive WTFPL.