Search Results for "dfa"

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.

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.

This project is derived from the dk.brics.automaton DFA library, version 1.11-8. The most significant change is the addition of a 'info' field to automaton states, allowing them to be associated with a token type. A few automaton operations were modified to preserve the value of this field. I have not given much thought to whether it would even make sense to preserve the 'info' field through some of the other operations.

JPlex is an unconventional lexical analyzer generator for Java. JPlex lexers are NIO-based, DFA-powered, push-driven, and fully decoupled and reusable. Their state machines are precompiled and serialized, so run time initialization is fast no matter how large the rule set. JPlex is not a parser generator; it only generates an interface for its parsers, and it does not build a parse tree. When the lexer identifies a token that has a named event associated with it, it passes the token to the parser method associated with that event. ...

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.

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.

Finite automation，developed by java and it's open source.input the RE,can produce RG,NFA,DFA,MinDFA,Draw the corresponding transition diagram and show the details of transition.

The project implements Dana Angluin's learning algorithm with intent to look into the possibility of computational learning of changing (shifting) information.