-
Notifications
You must be signed in to change notification settings - Fork 1
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
a4f506a
commit 3736ecc
Showing
1 changed file
with
32 additions
and
1 deletion.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,4 +1,35 @@ | ||
# YAAS | ||
Yet Another Automata Simulator (YAAS) is a prototype tool for simulating the execution of Finite Automata, Pushdown Automata and Turing Machines. | ||
|
||
Yet Another Automata Simulator (YAAS) is a prototype tool for simulating the execution of Finite Automata, Pushdown Automata and Turing Machines. The current tool features are: | ||
|
||
## Finite Automata (FA) | ||
|
||
- Full support for Deterministic and Nondeterministic Finite Automata modeling, test and simulation; | ||
- Create, edit, save and save as image; | ||
- Support to add all missing transitions; | ||
- Support for removal of inaccessible and useless states; | ||
- Conversion from Nondeterministic Finite Automaton to Deterministic Finite Automaton; | ||
- Deterministic Finite Automaton minimization; | ||
- Regular Operations: | ||
- Union; | ||
- Concatenation; | ||
- Kleene Star; | ||
- Complement; | ||
- Intersection. | ||
|
||
## Pushdown Automata (PDA) | ||
|
||
- Full support for Deterministic and Nondeterministic Pushdown Automata modeling, test and simulation; | ||
- Create, edit, save and save as image; | ||
- Conversion from Final State to Empty Stack and vice-versa acceptance types. | ||
|
||
## Turing Machines (TM) | ||
|
||
- Full support for Deterministic Turing Machines modeling, test and simulation; | ||
- Support for Nondeterministic Turing Machines modeling; | ||
- Create, edit, save and save as image; | ||
- Automatic detection of infine loops, i.e., Turing Machines that never halt. | ||
|
||
## Author | ||
|
||
This tool is developed by Prof. Dr. David Buzatto. |