Select the type of automaton
Type strings for testing
Test Results:
You don't need to sign in.
You can continue as a guest user with access to local
Save/Load functionality only.
Solve problems to master the concepts of Automata Theory
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.
Alphabet: {a,b}
Construct a DFA that recognises strings over the alphabet {a,b} which end with "ab".
Alphabet: {a,b}
Construct a DFA that recognises strings over the alphabet {a,b} which start with "aa."
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.
Alphabet: {a,b}
Construct a DFA that recognises strings over the alphabet {a,b} which end with "ab".
Alphabet: {a,b}
Construct a DFA that recognises strings over the alphabet {a,b} which start with "aa."
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.
Alphabet: {a,b}
Construct a DFA that recognises strings over the alphabet {a,b} which end with "ab".
Alphabet: {a,b}
Construct a DFA that recognises strings over the alphabet {a,b} which start with "aa."
Alphabet: {a,b}
Construct an NFA that recognizes all words that contain the substring "ab".
Alphabet: {0,1,2,3,4,5,6,7,8,9}
Construct an NFA
Alphabet: {0,1,2,3,4,5,6,7,8,9}
Construct an NFA
Alphabet: {0,1,2,3,4,5,6,7,8,9}
Construct an NFA
Alphabet: {0,1,2,3,4,5,6,7,8,9}
Construct an NFA
Alphabet: {0,1,2,3,4,5,6,7,8,9}
Construct an NFA
Alphabet: {0,1,2,3,4,5,6,7,8,9}
Construct an NFA
Alphabet: {0,1,2,3,4,5,6,7,8,9}
Construct an NFA
Alphabet: {0,1,2,3,4,5,6,7,8,9}
Construct an NFA