Request New Subject
Home
Computer Science Engineering (CSE)
Theory of Computation
Q. Let the class of language accepted by finite state machine be L1 and the class of languages represented by regular expressions be L2 then (Solved)
1. L1
2. L1>=L2
3. L1 U L2 = .*
4. L1=L2
d. L1=L2
Related Topics
→ Computer Architecture and Organization
→ Microprocessor and Interfacing Technique
→ Computer Networks
→ Data Structure and Algorithms (DSA)
→ Operating System (OS)
→ Artificial Intelligence and Robotics (AIR)
→ Software Project Management (SPM)
→ Computer Fundamentals
→ High Performance Computing (HPC)
→ Data Communication and Computer Network
Subscribe Now
Get All Updates & News
Subscribe