Automata Theory Context Free Grammar Derivations Definitions Online Exam Quiz
Automata Theory Context Free Grammar Derivations Definitions GK Quiz. Question and Answers related to Automata Theory Context Free Grammar Derivations Definitions. MCQ (Multiple Choice Questions with answers about Automata Theory Context Free Grammar Derivations Definitions
The minimum number of productions required to produce a language consisting of palindrome strings over ?={a,b} is
Options
A : 3
B : 7
C : 5
D : 6
The entity which generate Language is termed as:
Options
A : Automata
B : Tokens
C : Grammar
D : Data
Which among the following cannot be accepted by a regular grammar?
Options
A : L is a set of numbers divisible by 2
B : L is a set of binary complement
C : L is a set of string with odd number of 0
D : L is a set of 0n1n
For S->0S1|e for ?={0,1}*, which of the following is wrong for the language produced?
Options
A : Non regular language
B : 0n1n | n>=0
C : 0n1n | n>=1
D : None of the mentioned
Production Rule: aAb->agb belongs to which of the following category?
Options
A : Regular Language
B : Context free Language
C : Context Sensitive Language
D : Recursively Ennumerable Language
Are ambiguous grammar context free?
Options
A : Yes
B : No
C :
D :
Chemical Engineering Basics - Part 1 more Online Exam Quiz
Automata Theory Cfl Closure Properties
Automata Theory Cfl Substitution Theorem
Automata Theory Chomsky Normal Form
Automata Theory Construction Yield Parse Tree
Automata Theory Converting Regular Expressions Automata
Automata Theory Deterministic Pda
Automata Theory Dfa Processing Strings