Write a regular expression for each of the following languages over {a,b}: • String of a's and b's that begin with a and end with b. • Strings that have at least two a's. • Strings that have an even number of a's. • Strings that do not have two a's in a row. • Strings that do not end with the substring ab.

Write a regular expression for each of the following languages over {a,b}: • String of a's and b's that begin with a and end with b. • Strings that have at least two a's. • Strings that have an even number of a's. • Strings that do not have two a's in a row. • Strings that do not end with the substring ab.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 6PE

See similar textbooks

Similar questions

Design Regular Expressions for the following languages. ii. Strings representing a word with length divisible by 4 and contains at least 1 vowel. E={a, b, c,..., z} iii. Strings that contain '01' as substrings at any place except at the beginning or at the end. It accepts 1010, 0101,110110, etc. but does not accept 01, 0110, 1101, 00, etc. E={0, 1} iv. Length of the strings cannot be less than 3 characters and the number of 1's is divisible by 2. It accepts, 101, 1001, 1111, etc. however rejects e, 0, 1, 11, 100, 111, etc. E={0, 1} v. Strings where no character appears consecutively more than 3 times? E={a,b,c}
19. Given: Σ = {0, 1}, write regular expressions for the following languages: Strings that have a length of at most three. Strings that have a length divisible by 3. Strings that have no more than two 0s. Strings that do not end with 11. Strings that consist of only 1s and interpreted as a binary number are even
Design Regular Expressions for the following languages. Strings that contain ‘01’ as substrings at any place except at the beginning or at the end. It accepts 1010, 0101,110110, etc. but does not accept 01, 0110, 1101, 00, etc. Ʃ={0, 1}
Design Regular Expressions for the following languages. i. Strings that contains at least two 1's and exactly three O's. E={0, 1} ii. Strings representing a word with length divisible by 4 and contains at least 1 vowel. E={a, b, c,..., z} ii. Strings that contain '01' as substrings at any place except at the beginning or at the end. It accepts 1010, 0101,110110, etc. but does not accept 01, 0110, 1101, 00, etc. Σ {0, 1 iv. Length of the strings cannot be less than 3 characters and the number of 1's is divisible by 2. It accepts, 101, 1001, 1111, etc. however rejects e, 0, 1, 11, 100, 111, etc. E={0, 1} v. Strings where no character appears consecutively more than 3 times? E={a,b,c}
Specification: Read sentences from the user until * is entered. Show the number of words in each sentence that contain a stretch of non-z characters with exactly 2 vowels. A stretch starts from the start of the word or after a 'z'. A stretch terminates just before another 'z' or at the end of the word. Examples: 1. Matching words: zoo, azozooza, GONZALEZ 2. Non-matching words: ozo, azoooza The sentences contain no punctuation, the words are separated by one or more spaces, and the characters may be upper or lower case. Keep reading sentences until the user enters "*". Sample I/O: Sentence: azoooza azooza zoo azoo Matching words = 3 Sentence: GONZALEZ passes the ball to VAZQUEZ Matching words = 3 Sentence: azozototzeti Matching words = 1 Sentence: * Done
Language : C Jojo remembered going to a cave with his best friend Lili before the coronavirus pandemic.There, he saw several Stalactites hanging from the /cave’s ceiling. Stalactite is a type offormation that hangs from the ceiling of caves.Jojo noticed an interesting fact about the stalactites. The stalactite formation in thiscave forms a pattern. He wonders how will the formation look like if the cave is of adifferent size. He has asked your help to visualize this formation. Format Input :A single line with an integer N denoting the size of the cave Format Output :A size N formation of stalactites. Do not print extra spaces behind the last ‘*’ character in each line. Constraints : • 1 ≤ N ≤ 12 Sample Input 1 :2 Sample Output 1*** *Sample Input 2 :3 Sample Output 2 :******* * * * *
regular expressions Exercise: Describe the languages denoted by the following regular expressions: ◦a) a(a|b)*a..a) a*ba*ba*ba*.b) (aa|bb)*((ab|ba)(aa|bb)*(ab|ba)(aa|bb)*)*. and gave me example for a and b contain 20 String
Q: Write regular expression for the following languages. All strings in which b is never tripled. It means that no words contain the substring bb. All the strings accepting b as second letter. Regular expression that accept only prime numbers. All the strings that start with aa, end with bb, and have alternating substrings ba in between. Language of all those strings with length greater than 3
CFG Assignment(at least 2 strings must be derive to prove each CFG) Language: of all strings having many 0’s or no zero, defined over {0} Language: of all strings having exactly one 0’s or exactly one 1, defined over {0,1} Language: of all strings having many 0’s or many 1’s or no zero or no one, defined over {0,1} 0*10*
1. Design a finite automaton for the following languages. To validate the automaton it must validate at least 4 strings and among them at least one string that is not accepted. a. Odd binary numbers. b. Even number of letter a's followed by odd number of letter b's c. Integers that are odd. d. Whole numbers divisible by 100. and. Language described in the following regular expression: ab*c+a*c* It is suggested to use the tool that appears in the following link:http://madebyevan.com/fsm/
Sub:-Flat Construct a NFA in which triple '1' is followed by triple '0' over Σ = {0, 1).
C# (All Possible Three-Letter Words from a Five-Letter Word) Write a program that reads a five-letter word from the user and produces all possible three-letter combinations that can be derived from the letters of the ive-letter word. For example, the three-letter words produced from the word “bathe” include the commonly used words “ate,” “bat,” “bet,” “tab,” “hat,” “the” and “tea,” and the 3-letter combinations “bth,” “eab,” etc.