Question: If L1? and L2? are regular languages, then L1.L2 will be
Options
A : regular
B : non regular
C : may be regular
D : none of the mentioned
Automata Theory Online Test more questions
L and ~L are recursive enumerable then L is?
Every grammar in Chomsky Normal Form is:
If A and B are regular languages, !(A’ U B’)....
If L is a regular language, then (((L’)r)’)* is:
If L1 and L2? are regular languages, L1 ? (L2?....
Which file type of the Linux hold lists of files....
If both CO and O2, both are indicated in the....
Which edge of the COOL contains information about the amount....
Which of the following are not meant to specify a....
What kind of expressions do we used for pattern matching?
Chemical Engineering Basics - Part 1 more Online Exam Quiz
Automata Theory Multitape Turing Machine
Automata Theory Non Deterministic Finite Automata Introduction
Automata Theory Non Deterministic Polynomial Time
Automata Theory Non Deterministic Turing Machines
Automata Theory Operators Regular Expression
Automata Theory Pda Acceptance Empty Stack
Automata Theory Polynomial Space Turing Machine