Automata Theory Quiz Online Exam Quiz
Automata Theory Quiz GK Quiz. Question and Answers related to Automata Theory Quiz. MCQ (Multiple Choice Questions with answers about Automata Theory Quiz
Which of the following represents a language which has no pair of consecutive 1’s if ?= {0,1}?
Options
A : (0+10)*(1+?)
B : (0+10)*(1+?)*
C : (0+101)*(0+?)
D : (1+010)*(1+?)
(a + b*c) most correctly represents:
Options
A : (a +b) *c
B : (a)+((b)*.c)
C : (a + (b*)).c
D : a+ ((b*).c)
The given NFA represents which of the following NFA
Options
A : (ab U a) *
B : (a*b* U a*)
C : (ab U a*)
D : (ab)* U a*
Which of the following regular expressions represents the set of strings which do not contain a substring ‘rt’ if ?= {r, t}
Options
A : (rt)*
B : (tr)*
C : (r*t*)
D : (t*r*)
According to the precedence rules, x-y-z is equivalent to which of the following?
Options
A : (x-y)-z
B : x-(y-z)
C : Both (x-y)-z and x-(y-z)
D : None of the mentioned
Let for ?= {0,1} R= (???) *, the language of R would be
Options
A : {w | w is a string of odd length}
B : {w | w is a string of length multiple of 3}
C : {w | w is a string of length 3}
D : All of the mentioned
The finite automata accept the following languages:
Options
A : Context Free Languages
B : Context Sensitive Languages
C : Regular Languages
D : All the mentioned
Dot operator in regular expression resembles which of the following?
Options
A : Expressions are juxtaposed
B : Expressions are multiplied
C : Cross operation
D : None of the mentioned
The appropriate precedence order of operations over a Regular Language is
Options
A : Kleene, Union, Concatenate
B : Kleene, Star, Union
C : Kleene, Dot, Union
D : Star, Union, Dot
Regular Expression R and the language it describes can be represented as:
Options
A : R, R(L)
B : L(R), R(L)
C : R, L(R)
D : All of the mentioned
Chemical Engineering Basics - Part 1 more Online Exam Quiz
Automata Theory Pda Acceptance Empty Stack
Automata Theory Polynomial Space Turing Machine
Automata Theory Programming Techniques Storage Subroutines
Automata Theory Pumping Lemma Regular Language
Automata Theory Questions Bank
Automata Theory Randomized Algorithm
Automata Theory Regular Expression Introduction
Automata Theory Regular Expression Unix