...
JNU 2018-1 PhD CS
October 26, 2023
JNU 2018-1 PhD CS
October 26, 2023
JNU 2018-1 PhD CS
October 26, 2023
JNU 2018-1 PhD CS
October 26, 2023

JNU 2018-1 PhD CS

Question 2
Let L be a language that can be recognized by a finite automaton. The language LR consisting of reverse of the elements of L is a
A
regular language
B
context-free language
C
context-sensitive language
D
recursive language
Question 2 Explanation: 
The language that can be recognized by a finite automata is called regular language.And regular language is closed under reversal
Correct Answer: A
Question 2 Explanation: 
The language that can be recognized by a finite automata is called regular language.And regular language is closed under reversal
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!