Q2:(2.1) Write the regular expression for the language L over $\Sigma = \{0, 1\}$ in which every 0 is immediately followed by 11. (1 mark)
Added by Derrick G.
Close
Step 1
This means that the substring "0" cannot appear unless it is followed by "11". Show more…
Show all steps
Your feedback will help us improve your experience
Ramesh Rajak and 98 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Find the regular expression of the set of strings ending in 0 and not containing 111
Ramesh R.
Solve Description to Regular Expression problem Construct a regular expression that recognizes the following language of strings over the alphabet {0 1}: The language consisting of the set of all bit strings that start with 00 or end with 101 (or both). Syntax The union is expressed as R|R, star as R*, plus as R+, concatenation as RR. Epsilon is not supported but you can write R? for the regex (R|epsilon).
Rachel G.
Akash M.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD