Download
App
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
Let L be the language represented by the regular expression
What is the minimum number of states in a DFA that recognizes L (complement of L)?
4
5
6
8
Correct Option:
B
NA
Previous Question
Next Question
Your comments will be displayed only after manual approval.
Post your Comment
