Question 3: Write a regular expression for each of the following languages: (a) all strings over {a,b,c} that are of length at most three. (b) all strings over {a, b, c} that are of length exactly two. (c) All strings over {0, 1} that start with 1 and end with 0. (d) All strings over {0, 1} that end in 101

Question 3: Write a regular expression for each of the following languages: (a) all strings over {a,b,c} that are of length at most three. (b) all strings over {a, b, c} that are of length exactly two. (c) All strings over {0, 1} that start with 1 and end with 0. (d) All strings over {0, 1} that end in 101

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter2: Elements Of High-quality Programs

Section: Chapter Questions

Problem 5RQ

See similar textbooks

Similar questions

Q No. 1: Write regular expressions and construct NFA for the following languages over the alphabet E ={a, b} a. Write a regular expression that contains at least two a's b. Write a regular expression that contains at least one a and one b c. Write a regular expression that contains exactly two a's d. All strings that do not end with 'aa' e. All strings that contain even number of a's f. All strings which do not contain the substring 'ab' g. All strings that contain odd number of a's and b's
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
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.
Generate a constrained Regular Expression for the language that is described by the following: 1) all strings MUST begin with at least one 'a' character 2) all strings MUST end with EXACTLY one 'a' 3) between the 'a' characters are an unknown number of 'b', 'c', and 'd' characters. 4) the number of 'c' characters are at least one. 5) the number of 'b' characters is exactly the same as the number of 'd' characters.
IN C PROGRAMMING LANGUAGE AND COMMENT EVERY STEP PLEASE Write a program that takes verbs and forms their past tense on the basis of these rules: a. If verb ends in “e”, add “d”. b. If verb ends in “ss” or “gh”, add “ed”. c. In all other cases, inform the user that the verb may have an irregular past tense. Print each verb and its past tense. Try the following data: smile discuss confess declare laugh run cough teach buy
Exercise 7. Let E= {a,b,c}. Write a regular expression which can generate the language that has odd number of a's, even number of b's and a single c character.
Write the following expressions in C language using functions from the math library: 1. e-10r 2. In(y) 3. arcsin(.5) 4. cos(30°), 5. (a-b) 6. VA 7. cos (x² + y*), TR 8. V =- 3 tan e R -(R-y tan 6)*| tan e 3
Consider the following expression in C: a/b > 0 && b/a > 0.What will be the result of evaluating this expression when a is zero? What will be the result when b is zero? Would it make sense to try to design a language in which this expression is guaranteed to evaluate to false when either a or b (but not both) is zero? Explain your answer.
A palindrome is a string that reads the same forwards or backwards; for example dad, mom, deed are palindromes (i.e., reversing a palindrome produces the same string). Use C++ Programing language Write a recursive, boolean-valued function, isPalindrome that takes a string as a parameter and returns whether the string is a palindrome. A string, s, is a palindrome if: s is the empty string or s consists of a single letter (which reads the same back or forward), or the first and last characters of s are the same, and the rest of the string (i.e., the second through next-to-last characters) form a palindrome. Write a test program that reads a string from the standard input device and outputs whether the input string is a palindrome or not.
Translator Write a program that deals a number of cards (their numerical values) to a player's hand. To begin, the program asks the player for the values of the deck of cards to realize the program in c language. Then, the program deals the first two cards of the deck to a player's hand, and asks him if he wants another card. If he does not want a card, the program ends. If he wants a card, the program deals the next available card in the deck, adds it to the player's hand, and asks the player if he wants another card. The dealing process repeats as long as the user continues to accept cards, or until the cards in the deck run out. Card dealing involves copying the available card from the deck vector to another vector, which stores the player's hand, at the next available position. Assume that the deck of cards consists of only 10 cards with numerical values from 1 to 10, which the player will enter by keyboard before the program deals. The following functions…
3. A palindrome is a sentence that contains the same sequence of letters read-ing it either forwards or backwards. A classic example is "Able was I, ere I saw Elba." Write a recursive function that detects whether a string is a palindrome. The basic idea is to check that the first and last letters of the string are the same letter; if they are, then the entire string is a palindrome if everything between those letters is a palindrome. There are a couple of special cases to check for. If either the first or last character of the string is not a letter, you can check to see if the rest of the string is a palindrome with that character removed. Also, when you compare letters, make sure that you do it in a case-insensitive way. Use your function in a program that prompts a user for a phrase and then tells whether or not it is a palindrome. Here's another classic for testing: "A man, a plan, a canal, Panama!"
Write in C language Description 請寫一個程式找到三個數的最大公因數。 Please write a program to find the greatest common divisor of three number. Input 輸入會包含多筆測試資料，每筆測試資料一行，每行中有三個正整數，整數間會用一個空白隔開。 Input consist several test case, each test case a line. For every test case there are three integer in it and separate by a space. Output 對每一筆測試資料輸出一行結果。 For each test case output the result in one line. Sample Input 1 3 6 9 10 15 20 Sample Output 1 3 5