Which of the following statements is/are correct? I. The language L accepts all the strings of a's and b's where the third symbol from left end is b. The regular expression for L is (a +b)* b(a +b)* . II. The language L accepts all the strings of a's and b's where the number of a's in a string is divisible by 3. The regular expression for L is (b* ab* ab* ab*)*. III. The regular expression R=(a+b)" . The number of states required to construct the minimal DFA for the regular expression R is n+2.

Which of the following statements is/are correct? I. The language L accepts all the strings of a's and b's where the third symbol from left end is b. The regular expression for L is (a +b)* b(a +b)* . II. The language L accepts all the strings of a's and b's where the number of a's in a string is divisible by 3. The regular expression for L is (b* ab* ab* ab). III. The regular expression R=(a+b)" . The number of states required to construct the minimal DFA for the regular expression R is n+2.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter7: User-defined Simple Data Types, Namespaces, And The String Type

Section: Chapter Questions

Problem 3PE

See similar textbooks

Similar questions

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.
a) Design a regular expression that accepts the language of all binary strings which their length is odd with no occurrences of 11. b) Design a regular expression that accepts the language of all binary strings with no occurrences of 001.
CODE USING C++ Can you identify if Cody's name is spelled right? If so, then make a program that accepts four one-letter strings separated by space and print "Correct" if the inputted strings, combined in order, spell the name Cody correctly. If not, print "Wrong". It doesn't matter if it's in uppercase or lowercase, as long as it's spelled correctly, it's considered correct. Now, will you take on this task? Input A line containing four one-letter strings separated by a space. c·O·D·y Output A line containing a string. Correct
Python Language Useful websites: : http://en.wikipedia.org/wiki/Radix http://www.purplemath.com/modules/numbbase.htm Special Rules: Use only Boolean/math expressions and conditional statements (if-statements). Do not use built-in functions for converting integers into a string representation. Here to start with: kthDigit(x: int, b: int, k: int) -> int .........
Question 3 Regular expression for all strings starts with ab and ends with bba is. a) aba*b*bba b) ab(ab)*bba c) ab(a+b)*bba d) (ab)*bba
Enter two strings and check whether one string is the reverse of other or not. For example, consider the strings “vikas” and “sakiv”, you can notice that one string is the reverse of other(IN C LANGUAGE)
python: a function that counts the number of occurrences of given character in a given string. For example, calling the function with Count(‘j’, ‘just joshin’) returns 2. Note the function counts the character regardless of case.
Write the following in C++ Allow the user to enter a string with up to 100 letters. Display the user-entered string: Forward Backward Vertical As a triangle made from the letters of the string Display the number of letters in the string. Once everything above is displayed, the program will ask the user if he or she wishes to enter a different string or quit.
Convert int to string without the itoa function. This is C programming.
Q2/ (a) A student is given 3 tests, each marked out of 100. The student passes if his average mark is greater than or equal to 50 and fails if his average mark is less than 50. Prompt for the 3 marks and print pass if the student passes and fail otherwise. Write a program in C language to solve this.
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
The following C program requests four string from the user, sorts the four strings alphabetically and prints out the strings alphabetically as well as the string length. A typical usage input and output is shown below: Enter a string less than 50 characters in length: zebraEnter a string less than 50 characters in length: monkeyEnter a string less than 50 characters in length: baboonEnter a string less than 50 characters in length: apeape, [3]baboon, [6]monkey, [6]zebra, [5] Complete the following C program using the code provided. #include <stdio.h>#include <string.h> void swapstr(char *str1, char *str2); void main(void){ //line 1 int i = 0, j = 3; do { printf("Enter a string less than 50 characters in length: "); //line 2 i++; //line 3 //sort strings alphabetically //line 4 //line 5 //line 6 }//for j--; }//while //print sorted strings and its length //line 7 //line 8 }}//main void…