AIDE (Automata-Identification Engine)

  •        80

AIDE is a automata-identification engine.

http://aide.codeplex.com/

Tags
Implementation
License
Platform

   




Related Projects

SmartAnt3 - Mealy machine + Evolutionary Computation + Ant 3


Mealy machine + Evolutionary Computation + Ant 3

state_machine - Mealy/Moore finite state machine simulator


Mealy/Moore finite state machine simulator

DFA-NFA - DFA-NFA Machine


DFA-NFA Machine

crowbarcentral-mealy-0010 - A simple mealy automaton that detects the sequence '0010'


A simple mealy automaton that detects the sequence '0010'

Machine Connects


Machine Connects monitors a variety of sensors pertaining to the operation of a carburated engine. This information will be logged as well as pushed to an android device via Bluetooth as a visual aide in modifying parameters and seeing the results on various graphs.



Munch - Conversation tool for regular expressions -> episilon NFA -> DFA -> minimized DFA


Conversation tool for regular expressions -> episilon NFA -> DFA -> minimized DFA

raft - Golang implementation of the Raft consensus protocol


raft is a Go library that manages a replicated log and can be used with an FSM to manage replicated state machines. It is a library for providing consensus.The use cases for such a library are far-reaching as replicated state machines are a key component of many distributed systems. They enable building Consistent, Partition Tolerant (CP) systems, with limited fault tolerance as well.

DFA-Builder - Auto generates a C++ program that runs a DFA that counts substrings


Auto generates a C++ program that runs a DFA that counts substrings

dfa-sample - Dfa - Doubleclick using new version of API - Reporting


Dfa - Doubleclick using new version of API - Reporting

NDFA-DFA - Java automata transformer from NDFA to DFA


Java automata transformer from NDFA to DFA

c-dfa - c code for dfa


c code for dfa

DFA-Statemap - Release history of DFA-Statemap


Release history of DFA-Statemap

DFA-Simple - Release history of DFA-Simple


Release history of DFA-Simple

DFA-Kleene - Release history of DFA-Kleene


Release history of DFA-Kleene

DFA-Command - Release history of DFA-Command


Release history of DFA-Command

cdparra-afgen


AFGEN is a midterm university project from the "Compilers Design" class of Computers Engeneering career at the Politecnic Faculty of the National University of Asuncion, Paraguay. The idea is to create a Regular Expression converter to the equivalent Non-Deterministic Finite Automaton (NFA), following the Thompson Algorithm and using a Syntax-Directed Translation engine of one pass. With the NFA, we use the Subset Construction algorithm to obtain the corresponding DFA, which is then minimized to

meramos-DFA


Program that receives the description of a language that corresponds to a DFA, then asks for a string thus to see if it is accepted by the DFA or not.

flavioricardo-DFA


Simulates a deterministic finite-state machine

Aide-Scilab - Aide-Mémoire Scilab


Aide-Mémoire Scilab