Deterministic Finite Automata: Examples

At Most Two Consecutive b

any sequence on the alphabet I={a,b} containing at most two consecutive b's.

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

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