Academic Resource
Aptitude
Data Interpretation
Verbal Reasoning
Non Verbal Reasoning
Verbal Ability
Programming
General Knowledge
Puzzle
Engineering
Computer Engineering
Electronics and Communication
Electrical Engineering
Mechanical Engineering
Civil Engineering
Biotechnology
Architecture & Planning
Online Test
Aptitude Test
Data Interpretation Test
Verbal Reasoning Test
Non Verbal Reasoning Test
Verbal Ability Test
Exams
More
Full Forms
Home
»
Theory of Computation
»
Theory of computation miscellaneous
» Question
Theory of computation miscellaneous
Easy Questions
Theory of Computation
Theory of computation miscellaneous
If L
1
= { a
n
| n ≥ 0 } and L
2
= { b
n
| n ≥ 0 } , consider
(I) L
1
.L
2
is a regular language
(II) L
1
.L
2
= {a
n
b
n
| n ≥ 0}
Which one of the following is CORRECT?
Only (I)
Only (II)
Both (I) and (II)
Neither (I) nor (II)
Correct Option:
A
NA
Previous Question
Next Question
Your comments will be displayed only after manual approval.
Post your Comment