Deterministic Finite Automata: Examples

a(bb)*bc

the language a(bb)*bc, i. e. the language formed by words that begin with an a followed by an odd number of b and a final c.

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

If AUTOMATA is already running, you 'd better load the file example02.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