Properties-Non Regular Languages Online Exam Quiz
Properties-Non Regular Languages GK Quiz. Question and Answers related to Properties-Non Regular Languages. MCQ (Multiple Choice Questions with answers about Properties-Non Regular Languages
A regular language over an alphabet a is one that can be obtained from
Options
A : union
B : concatenation
C : kleene
D : All of the mentioned
a? is equivalent to
Options
A : a
B : a+?
C : a+?
D : wrong expression
Finite state machine are not able to recognize Palindromes because:
Options
A : Finite automata cannot deterministically find the midpoint
B : Finite automata cannot remember arbitarily large amount of data
C : Even if the mid point is known, it cannot find whether the second half matches the first
D : All of the mentioned
Given languages:^ i) {anbn|n>=0}^ ii) <div>n</div>n^ iii) {w?{a,b}?| #a(w)=#b(w)}, # represents occurrences^ Which of the following is/are non regular?
Options
A : i, iii
B : i
C : iii
D : i, ii, iii
Myphill Nerode does the following:
Options
A : Minimization of DFA
B : Tells us exactly when a language is regular
C : Both (a) and (b)
D : None of the mentioned
Precedence of regular expression in decreasing order is
Options
A : * , . , +
B : . , * , +
C : . , + , *
D : + , a , *
Regular expression {0,1} is equivalent to
Options
A : 0 U 1
B : 0 / 1
C : 0 + 1
D : All of the mentioned
Regular expression ?* is equivalent to
Options
A : ?
B : ?
C : 0
D : 1
Which of the following are related to tree automaton?
Options
A : Myphill Nerode Theorem
B : State machine
C : Courcelle's Theorem
D : All of the mentioned
Which of the following options is incorrect?
Options
A : A language L is regular if and only if ~L has finite number of equivalent classes.
B : Let L be a regular language. If ~L has k equivalent classes, then any DFA that recognizes L must have atmost k states.
C : A language L is NFA-regular if and only if it is DFA-regular.
D : None of the mentioned
Ambiguous Grammar more Online Exam Quiz
Deterministic Finite Automata-Introduction and Definition
Finding Patterns in Text,Algebric Laws and Derivatives
From Grammars to Push Down Automata
Node-Cover Problem, Hamilton Circuit Problem
Problem Solvable in Polynomial Time
Regular Language & Expression - 1
Turing Machine-Notation and Transition Diagrams
Engine Components - Connecting Rod