Finite Automata Designer

🟢 Easy 🟢

Multiples of 5

Alphabet: {0,1,2,3,4,5,6,7,8,9}

Construct a DFA that recognises numbers in the decimal system which are multiples of 5.

Ending with "ab"

Alphabet: {a,b}

Construct a DFA that recognises strings over the alphabet {a,b} which end with "ab".

Starting with "aa"

Alphabet: {a,b}

Construct a DFA that recognises strings over the alphabet {a,b} which start with "aa."

🟡 Medium 🟡

Even Number of 0s and 1s

Alphabet: {0,1}

Construct a DFA that accepts binary strings with an even number of 0s and an even number of 1s.

No Consecutive 1s

Alphabet: {0,1}

Construct a DFA that accepts binary strings where no two 1s appear consecutively.

Contains Substring "101"

Alphabet: {0,1}

Construct a DFA that accepts binary strings containing "101" as a substring."

🔴 Hard 🔴

Divisible by 3 (Binary)

Alphabet: {0,1}

Construct a DFA that recognises numbers divisible by 3 in the binary system.

Equal Number of "01" and "10" Substrings

Alphabet: {0,1}

Construct a DFA that accepts strings where the number of "01" substrings equals the number of "10" substrings.

Third Symbol from end is "a"

Alphabet: {a,b}

Construct a DFA that accepts strings where the third symbol from the end is "a".

Easy

Contains "aaa" or "bbb"

Alphabet: {a,b}

Construct an NFA that accepts strings containing "aaa" or "bbb" as a substring.

Strings ending with "00" or "11"

Alphabet: {0,1}

Construct an NFA that accepts strings in the binary system ending with "00" or "11".

Starts and Ends with the Same Symbol

Alphabet: {a,b}

Construct an NFA that accepts strings starting and ending with the same symbol.

Medium

Length Divisible by 2 or 3

Alphabet: {a}

Construct an NFA that accepts strings of the symbol "a" length divisible by 2 or 3.

Contains "ab" or "ba"

Alphabet: {a,b}

Construct an NFA that accepts strings containing "ab" or "ba" as a substring.

Second Symbol is "1"

Alphabet: {0,1}

Construct an NFA that accepts binary strings where the second symbol is "1"

Hard

Contains "010" but Not "101"

Alphabet: {0,1}

Construct an NFA that accepts strings in the binary system, containing "010" but not "101"

All strings where the 5th Symbol from the End is "a"

Alphabet: {a,b}

Construct an NFA accepting strings where the 5th symbol from the end is "a".

Even 0s or Odd 1s (or Both)

Alphabet: {0,1}

Construct an NFA that accepts strings with an even number of 0s and/or an odd number of 1s.

Finite Automata Simulator

States

Transitions

Actions

Test Automaton

LEARNING SECTION (Under Construction ...)

🟢 Easy 🟢

Multiples of 5

Ending with "ab"

Starting with "aa"

🟡 Medium 🟡

Even Number of 0s and 1s

No Consecutive 1s

Contains Substring "101"

🔴 Hard 🔴

Divisible by 3 (Binary)

Equal Number of "01" and "10" Substrings

Third Symbol from end is "a"

Easy

Contains "aaa" or "bbb"

Strings ending with "00" or "11"

Starts and Ends with the Same Symbol

Medium

Length Divisible by 2 or 3

Contains "ab" or "ba"

Second Symbol is "1"

Hard

Contains "010" but Not "101"

All strings where the 5th Symbol from the End is "a"

Even 0s or Odd 1s (or Both)

States

Transitions

Actions

Test Automaton

Save Automaton

Load Automaton

My Saved Automatons

Manage Your Saved Automatons

LEARNING SECTION (Under Construction ...)

🟢 Easy 🟢

Multiples of 5

Ending with "ab"

Starting with "aa"

🟡 Medium 🟡

Even Number of 0s and 1s

No Consecutive 1s

Contains Substring "101"

🔴 Hard 🔴

Divisible by 3 (Binary)

Equal Number of "01" and "10" Substrings

Third Symbol from end is "a"

Easy

Contains "aaa" or "bbb"

Strings ending with "00" or "11"

Starts and Ends with the Same Symbol

Medium

Length Divisible by 2 or 3

Contains "ab" or "ba"

Second Symbol is "1"

Hard

Contains "010" but Not "101"

All strings where the 5th Symbol from the End is "a"

Even 0s or Odd 1s (or Both)