Question: 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
Automata Theory Context Free Grammar Derivations Definitions more questions
The inductance of a coaxial cable with inner radius a....
The length of member should be _________ for a short....
Which frequency band is used for connecting the satellite system....
Identify the given type of joint in Concrete Structures.
Which of these is not a cylinder head type of....
What can be said about a regular language L over....
Series electromagnet consists of _________
The rectangular type of C.T. is built of _________
The material balance optimization is also referred as
Which two parameters given below are zero in the lossless....
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