Search Results for "finite automata"
Sort By:
Showing 39 open source projects for "finite automata"
View related business solutions-
Full-stack observability with actually useful AI | Grafana CloudBuilt on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
-
Enterprise-grade ITSM, for every businessFreshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
-
1
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”). -
2
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:... -
3
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. -
4
A package for computations with finite automata (rooted tree automorphisms) for the GAP system, http://www.gap-system.org.
-
Fully Managed MySQL, PostgreSQL, and SQL ServerCloud SQL handles your database ops end to end, so you can focus on your app.
-
5
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. -
6
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
-
7
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. -
8
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. -
9
-
Go From AI Idea to AI App FastAccess Gemini 3 and 200+ models. Build chatbots, agents, or custom models with built-in monitoring and scaling.
-
10
Java FiniteStateMachine
Simple Finite State Machine in Java
Implementation of a few Finite Automata in Java. The project is mainly of academic interest but can also be used to describe state transition diagrams in a business application. Check out the project wiki for a quick introduction: https://sourceforge.net/p/javafsm/wiki/Home/ -
11
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. -
12
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.
-
13
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.
-
14
ENuSMV-1.2
Extend NuSMV
ENuSMV-1.2 (extends from NuSMV-2.5.4) is a model checking tool that supporting both BDD-based and bounded model checking of ETL employing both finite and looping acceptance automata connectives. -
15
The class library monq.jfa provides text filtering with regular expressions. In contrast to java.util.regex, it allows each regular expression to be bound to an action that is automatically called whenever a match is spotted in an input stream.
-
16
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.
-
17
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.
-
18
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. -
19
GUI application that can be used for generate graph representation for any given DFA or NFA table and check weather strings are accepted or rejected by finite automata.
-
20
-
21
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
-
22
-
23
superseded by SgpDec http://sgpdec.sf.net Java implementation of the holonomy algorithm for the algebraic hierarchical decomposition of finite state automata.
-
24
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.
-
25
SuperWillow is a Music Generation program. Artists have many influences which they have accumulated over the years by listening to countless pieces of music, this principle is reflected in SuperWillow.
