Skip to content

Decides whether or not a word is included in a language of a certain automaton. Based on theory of computations.

Notifications You must be signed in to change notification settings

panayiotiska/Automata-Executor

Repository files navigation

Automata-Executor

Decides whether or not a word is included in a language of a certain automaton. Based on theory of computations.

Examples of automata which can be solved :

Simple Automaton

Non-deterministic Automaton

Non-deterministic Automaton with ε-moves (#)

About

Decides whether or not a word is included in a language of a certain automaton. Based on theory of computations.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages