Nondeterministic Finite Automata: Examples

Two Consecutive 1's or 0's

the set of strings on the alphabet I={0,1} containing at least two consecutive 0's or two consecutive 1's.

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

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

• Next Example
• Nondeterministic Finite Automata