Nondeterministic Finite Automata: Examples

Strings starting and ending with an a

This automaton recognizes strings on the alphabet I={a,b} that must begin with an a can have an even number of a or any number of b and finish with an a. Or else the regular expression:

a ((aa)* U b*)* a

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

If AUTOMATA is already running, you'd better load the file example08.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
• Nondeterministic Finite Automata