Question
1. Design a regular language where every sentence has to start with any number of strings 101 (any number is none or more), then repeats
1. Design a regular language where every sentence has to start with any number of strings 101 (any number is none or more), then repeats 00 any number of times, then repeats 01 at least once.
2. For the above, how many valid strings there are?
3. For the above, how many valid strings are there if we restrict the total length to a) at most 7 bits? b) exactly 7 bits?
4. If you were designing a new programming language, would you make it regular, context free, context sensitive, or unrestricted and why?
5. If translation of your programs was not your concern at all (aliens offered to do it for you), would the above answer change and how and why?
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started