Question: Which of the following regular expression allows strings on {a,b}* with length n where n is a multiple of 4.
Options
A : (a+b+ab+ba+aa+bb+aba+bab+abab+baba)*
B : (bbbb+aaaa)*
C : ((a+b)(a+b)(a+b)(a+b))*
D : None of the mentioned
Automata Theory Regular Languages Dpda more questions
A monoid is called a group if _______
Complement of the expression A’B + CD’ is _________
Let A1, A2, be two AM’s and G1, G2 be....
The set of all strings over ? = {a,b} in....
Condition for monoid is __________
The given NFA represents which of the following NFA
Which of the following is an equivalence relation on R,....
DeMorgan’s theorem states that _________
For some number a, b and c, ac x bc....
Chemical Engineering Basics - Part 1 more Online Exam Quiz
Automata Theory Questions Bank
Automata Theory Randomized Algorithm
Automata Theory Regular Expression Introduction
Automata Theory Regular Expression Unix
Automata Theory Reversal Homomorphism Inverse Homomorphism
Automata Theory Rices Theorem Properties
Automata Theory Sentential Forms