Search Results for "automata"
Sort By:
Showing 18 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.
-
As your users rely more and more on Cloud and Internet-based technologies, reliable internet connectivity becomes more and more important to your business. With Bigleaf’s proven SD-WAN architecture, groundbreaking AI, and DDoS attack mitigation, you can finally deliver the reliable internet connectivity your business needs without the limitations of traditional networking platforms. Bigleaf’s Cloud Access Network and plug-and-play router allow for limitless control to and from anywhere your traffic needs to go. Bigleaf’s self-driving AI automatically identifies and adapts to any changing circuit conditions and traffic needs—addressing issues before they impact your users. Bigleaf puts you in the driver’s seat of every complaint and support call with full-path traffic and network performance data, delivered as actionable insights, reports, and alerts.
-
1
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... -
2
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... -
3
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. -
4
* 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
-
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.
-
5
LEE_FSM
Finite State Machine; PHP; LUA;
The software resents an executable specification language based on deterministic finite automata, this allows the user to perform tests of word recognition in the state machines that are defined by it. Moreover, it’s possible for the user to assign snippets of code to be executed every transition automaton, these snippets can be described in Lua or PHP programming language. To test that were conducted in the language, was developed a compiler that recognizes words and generates object code. -
6
Proyect aim is to develop a library which allow the management of very large dictionaries very efficiently using, for this purpose, numbered deterministic acyclic finite automata.
-
7
Cellular Automata
Explore Cellular Automata
Do experiments to extend knowledge of cellular automata stuff -
8
The SIMP/STEP platform provides a fast, efficient, portable abstract framework for interactive and scripted cellular automata and lattice gas computing in the Python environment. SIMP provides a high-level 'programmable matter' laboratory built on
-
9
MASyV (Multi-Agent System Visualization) enables one to write agent-based models/cellular automata, eg. in C, visualize them in real time & capture to movie file with MASyVs GUI & message passing lib. Includes examples: Hello World, ants, viral infection
-
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.
-
10
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
-
11
fick is fluid diffusion simulator (for both liquids and gases): it uses the Flick diffusion laws to drive the evolution of a cellular automata.
-
12
Foma is a compiler, programming language, and C library for constructing finite-state automata and transducers for various uses. It has specific support for many natural language processing applications such as producing morphological analyzers.
-
13
The purpose of this project is to create a dynamical chemistry simulation capable of creating and maintaining cellular-automata-like forms.
-
14
RexRex is a Regexp matching engine based on Automata Theory Principles (so-called DFA Engine) Implemented in ANSI C . currently it supports (,),*,+,?,Character classes ([],w,s,..etc) and escaping FWIW Rex is king in Latin;so it's RexKing :)
-
15
UltraLife simulates Conway's Game of Life, either automatically or one step at a time, with the ability to detect stable patterns and simple repeating states. It also simulates other cellular automata systems.
-
16
AMoRE is a collection of algorithms that deal with automata, monoids, regular expressions. Learn about the theory - this is not another regexp package.
-
17
This is a cellular automata program for Linux using SVGALib. Users can make rule and neighbourhood files or use ones that come with the program.
-
18
An artificial life (a field in artificial intelligence) implementation using GNOME as its front end. It uses some principals of Cellular Automata. It's like "Conway's Game of Life' but with a totally different ruleset. It's a fun simulation - check it out
- Previous
- You're on page 1
- Next