Aurelius

This app can simulate machines
- DEA automata (deterministic finite automaton)
determine:
- start state
- final states
Enter:
- input alphabet
- State transfer function
- Conditions
Simulation of the machine using input words
- MEALY machine
determine:
- start state
Issue:
- the number of states,
- the input alphabet,
- the output alphabet,
- the state transfer function,
- and the output function
Simulation of the machine using input words
Playback of the output word by the given input
Created by the computer science course Abi 2020 (MER) Wilhelm Bracke comprehensive school