Deterministic Finite Automata: Examples

Even number of b's

the set of all strings over the alphabet {a,b} that have an even number of b's.

Local users: to run simulation (read here before running).

If AUTOMATA is already running, you'd better load the file example05.aut from the main menu bar.

Actions:

• choose between a step by step simulation or a fast process
• write an input string directly from keyboard

• Previous Example
• Next Example
• Deterministic Finite Automata