Automata Theory Regular Expression Introduction Online Exam Quiz
Automata Theory Regular Expression Introduction GK Quiz. Question and Answers related to Automata Theory Regular Expression Introduction. MCQ (Multiple Choice Questions with answers about Automata Theory Regular Expression Introduction
The given NFA corresponds to which of the following Regular expressions?
Options
A : (0+1) *(00+11) (0+1) *
B : (0+1) *(00+11) *(0+1) *
C : (0+1) *(00+11) (0+1)
D : (0+1) (00+11) (0+1) *
If R represents a regular language, which of the following represents the Venn-diagram most correctly?
Options
A : An Irregular Set
B : R*
C : R complement
D : R reverse
L is a regular Language if and only If the set of __________ classes of IL is finite.
Options
A : Equivalence
B : Reflexive
C : Myhill
D : Nerode
A language can be generated from simple primitive language in a simple way if and only if
Options
A : It is recognized by a device of infinite states
B : It takes no auxiliary memory
C : Both are correct
D : Both are wrong
Concatenation of R with ? outputs:
Options
A : R
B : ?
C : R.?
D : None of the mentioned
RR* can be expressed in which of the forms:
Options
A : R+
B : R-
C : R+ U R-
D : R
Concatenation Operation refers to which of the following set operations:
Options
A : Union
B : Dot
C : Kleene
D : Two of the options are correct
Chemical Engineering Basics - Part 1 more Online Exam Quiz
Automata Theory Programming Techniques Storage Subroutines
Automata Theory Pumping Lemma Regular Language
Automata Theory Questions Bank
Automata Theory Randomized Algorithm
Automata Theory Regular Expression Unix
Automata Theory Regular Languages Dpda
Automata Theory Reversal Homomorphism Inverse Homomorphism