Automata Theory Regular Languages Dpda Online Exam Quiz
Automata Theory Regular Languages Dpda GK Quiz. Question and Answers related to Automata Theory Regular Languages Dpda. MCQ (Multiple Choice Questions with answers about Automata Theory Regular Languages Dpda
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
abb*c denotes which of the following?
Options
A : {abnc|n=0}
B : {abnc|n=1}
C : {anbc|n=0}
D : {abcn|n>0}
Let T={p, q, r, s, t}. The number of strings in S* of length 4 such that no symbols can be repeated.
Options
A : 120
B : 625
C : 360
D : 36
Which of the following is an incorrect regular expression identity?
Options
A : R+f=R
B : eR=e
C : Rf=f
D : None of the mentioned
A language is accepted by a push down automata if it is:
Options
A : regular
B : context free
C : both (a) and (b)
D : none of the mentioned
Which of the following relates to Chomsky hierarchy?
Options
A : Regular<CFL<CSL<Unrestricted
B : CFL<CSL<Unrestricted<Regular
C : CSL<Unrestricted<CF<Regular
D : None of the mentioned
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