1.a. Write a Regular Expression Language over ∑ = {a,b,c} a set of strings terminated by a or b. .b. Write a regular expression for the set of binary strings where each string has at least one pair of consecutive zeros. c. write the regular expression for the following, where sigma = (a,b): i. string of length at least 2 ii. string of length at most 2 iii. all string starting with a and ending with b iv. Even length Strings

1.a. Write a Regular Expression Language over ∑ = {a,b,c} a set of strings terminated by a or b. .b. Write a regular expression for the set of binary strings where each string has at least one pair of consecutive zeros. c. write the regular expression for the following, where sigma = (a,b): i. string of length at least 2 ii. string of length at most 2 iii. all string starting with a and ending with b iv. Even length Strings

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter9: Completing The Basics

Section9.4: Character Manipulation Functions

Problem 3E

See similar textbooks

Similar questions

Question : Let s be a string of length 2 with characters from {0, 1, 2}, and define statements a, b, c, and d as follows: a = "the first character of s is 0” b = “the first character of s is 1” c = “the second character of s is 1” d = “the second character of s is 2”. Describe the set of all strings for which each of the following is true.? ----on picture
Write regular expressions of the following languages- The set of strings that start and end with the same symbols 01. Σ = {0,1,2} The set of strings that contain both substrings ‘101’ and ‘000’. Σ = {0,1} The set of strings having 0 at every 3rd position from the beginning. Σ = {0,1}. For example- 000, 010, 0100100, 110110, etc. The set of strings that do not contain substring ‘10’. Σ = {0,1} The set of strings that do not end with ‘01’. Σ = {0,1} Following is an example of different ways one can declare variables in some programming language.Write down the regular expression that can generate such variable declarations.Assume that- All variable names are at most five (previously written as exactly five; both will be considered correct) characters long. Variable names can contain only small letters [a-z], digits [0-9], and two special characters $ (dollar) and _ (underscore). $ sign can only be used at the beginning. No names can start with digits. The variable types…
a) Give an example of a string that is neither in the language of R nor in S. b) Give an example of a string that is in the language of S but not R. c) Give an example of a string that is in the language of R but not S. d) Give an example of a string that is in the language of R and S. e) Design a regular expression that accepts the language of all binary strings with no occurrences of 010.
1. a Write a regular expression for the set of binary strings where each string has at least one pair of consecutive zeros. b. write the regular expression for the following, where sigma = (a,b): i. string of length at least 2 ii. string of length at most 2 iii. all string starting with a and ending with b iv. Even length Strings
A string is a palindrome if it reads the same from front to back as it does from back to front (e.g. "kayak", "rotator" and "noon" are palindromes). When determining whether an alphanumeric string is a palindrome, we often ignore spaces, punctuation and case in the string (e.g. "A man, a plan, a canal --Panama!" is also considered a palindrome). Write a complete C program to read a string, echo it to the screen, determine whether it is a palindrome, and write a message indicating whether it is or isn't. Your main function should prompt for the string, read the string, print it, call the clean function (to remove all spaces, punctuation, and turn uppercase letters into lowercase letters), print the new string, then call the reverse function (to place the characters into reverse order) and print the new string resulting. In the final step, you will compare the result of the reverse function with the original string and print a message if the string is a palindrome or not. The clean…
Write a program in C++ that reads a character (string of length 1) from theuser, and classifies it to one of the following: lower case letter, upper case letter,digit, or non-alphanumeric character.
1. Write a Python regex pattern that matches a valid email address, assuming that an email address consists of a username, followed by the "@" symbol, followed by a domain name, which in turn consists of one or more subdomains separated by dots, and ending with a top-level domain (e.g., .com, .org, .edu, etc.). 2. Using the re.findall() function in Python, write a Python code snippet that takes the text string and the regex pattern from Q4 and returns a list of all the email addresses found in the string. 3. Suppose you want to modify the regex pattern from Q4 to also match email addresses that contain hyphens ("-") in the username and/or domain name. What changes would you make to the pattern, and why? 4. Using the modified regex pattern from Q6, write a Python code snippet that takes the text string and the modified regex pattern, and returns a list of all the email addresses found in the string. Note: You can assume that the text string contains valid email addresses separated by…
Implement a function in a programming language of your choice to check if a given string is a palindrome. A palindrome is a word, phrase, number, or other sequence of characters that reads the same forward and backward.
Write a program in C++ to take input 5 strings and concatenate them in reverse order of their input, the string entered last should be present at start in the concatenated string. Print the string formed in output. Input: "A" "B" "C" "D" "E" Output: "EDCBE"
Write a C program to read a string and sort the letters of the string in ascending order, using functions and pointers. Input=university Output= eiinrstuvy
Write a program in C programming language that takes two arguments at the command line, both strings. The program checks to see whether or not the second string is a substring of the first (without using the substr -- or any other library -- function). One caveat: any * in the second string can match zero or more characters in the first string, so if the input were abcd and the substring was a*c, then it would count as a substring. Also, include functionality to allow an asterisk to be taken literally if preceded by a \, and a \ is taken literally except when preceding an asterisk.
Write a C++ program to input a string that contains both alphabets and digits. Replace all digits in the string with the character '%' and also display the count of the total replacements done in the string.