[go: up one dir, main page]

Showing 123 open source projects for "automata"

View related business solutions
  • Gen AI apps are built with MongoDB Atlas Icon
    Gen AI apps are built with MongoDB Atlas

    The database for AI-powered applications.

    MongoDB Atlas is the developer-friendly database used to build, scale, and run gen AI and LLM-powered apps—without needing a separate vector database. Atlas offers built-in vector search, global availability across 115+ regions, and flexible document modeling. Start building AI apps faster, all in one place.
    Start Free
  • Yeastar: Business Phone System and Unified Communications Icon
    Yeastar: Business Phone System and Unified Communications

    Go beyond just a PBX with all communications integrated as one.

    User-friendly, optimized, and scalable, the Yeastar P-Series Phone System redefines business connectivity by bringing together calling, meetings, omnichannel messaging, and integrations in one simple platform—removing the limitations of distance, platforms, and systems.
    Learn More
  • 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...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2
    Golly

    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.
    Leader badge">
    Downloads: 455 This Week
    Last Update:
    See Project
  • 3
    DEVS-Suite Simulator

    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) with domain-specific models: NoC; SW/HW co-design, Service-Oriented Computing, cancer biology, Dynamic Structure, SOA DEVS, MIPS32 processors, and computer networks for education. ...
    Downloads: 1 This Week
    Last Update:
    See Project
  • 4
    CART

    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
    Downloads: 2 This Week
    Last Update:
    See Project
  • Easy-to-Use Website Accessibility Widget Icon
    Easy-to-Use Website Accessibility Widget

    An accessibility solution for quick website accessibility improvement.

    All in One Accessibility is an AI based accessibility tool that helps organizations to enhance the accessibility and usability of websites quickly.
    Learn More
  • 5
    Algorithms Math Models

    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 6
    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 7
    XWizard

    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”).
    Downloads: 1 This Week
    Last Update:
    See Project
  • 8
    Lexical Analyzer Generator Quex

    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...
    Leader badge">
    Downloads: 38 This Week
    Last Update:
    See Project
  • 9

    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. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • Dominate AI Search Results Icon
    Dominate AI Search Results

    Generative Al is shaping brand discovery. AthenaHQ ensures your brand leads the conversation.

    AthenaHQ is a cutting-edge platform for Generative Engine Optimization (GEO), designed to help brands optimize their visibility and performance across AI-driven search platforms like ChatGPT, Google AI, and more.
    Learn More
  • 10
    CASUP

    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.
    Downloads: 1 This Week
    Last Update:
    See Project
  • 11

    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 12
    A package for computations with finite automata (rooted tree automorphisms) for the GAP system, http://www.gap-system.org.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 13

    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/).
    Downloads: 0 This Week
    Last Update:
    See Project
  • 14
    CoSMoSim

    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).
    Downloads: 1 This Week
    Last Update:
    See Project
  • 15
    AutoSim

    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.
    Downloads: 8 This Week
    Last Update:
    See Project
  • 16

    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]
    Downloads: 0 This Week
    Last Update:
    See Project
  • 17
    ...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
    Downloads: 0 This Week
    Last Update:
    See Project
  • 18

    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. ...
    Downloads: 4 This Week
    Last Update:
    See Project
  • 19
    .... ==== 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.
    Downloads: 1 This Week
    Last Update:
    See Project
  • 20
    DDLab
    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
    Downloads: 1 This Week
    Last Update:
    See Project
  • 21
    Finite-Automata

    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 22

    physicsmata

    API for all possible cellular automata that work same at all angles

    ...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 are optional) at concentric circles around each point, efficiently costing only the perimeter of those circles (instead of the area) because of the tree of squares. You can create any function, or to get started try the visual function editor where each click changes if a column is sine/sigmoid/half/double/exp/etc or which of the 0, 1, or 2 columns to the left are its params. ...
    Downloads: 1 This Week
    Last Update:
    See Project
  • 23
    Qfsm

    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.
    Downloads: 7 This Week
    Last Update:
    See Project
  • 24

    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...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 25
    Small GAP package for converting Petri nets to finite state automata and transformation semigroups.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • 2
  • 3
  • 4
  • 5
  • Next