Request New Subject
Home
Computer Science Engineering (CSE)
Theory of Computation
Q. If a language is denoted by a regular expression L = ( x )* (x y x ), then which of the following is not a legal string within L ? (Solved)
1. yx
2. xyx
3. x
4. xyxyx
d. xyxyx
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