Q2. Construct regular expressions for the following languages. Verify your answer by generating at least one correct string. a. The language over the alphabet (a, b, c) of all three letter words that end in bc b. The language over the alphabet (a, b, c}of all words starting with any number of a's, followed by any number of b's and ending in one or two c's c. The language over the alphabet (a, b, c, d, e, f} where each string starts with a "ab", has either c or d in the middle, and ends with any number of the substring "ef". d. The language over the alphabet (a, b, c) of all words where the words start with either an a or a b followed by as many c's as we want. (the total number or a or b cannot be more that 1) (in any string ther can only be one a or one b) e. The language of only those strings over A= {0, 1} which have exactly 2 zeros

Q2. Construct regular expressions for the following languages. Verify your answer by generating at least one correct string. a. The language over the alphabet (a, b, c) of all three letter words that end in bc b. The language over the alphabet (a, b, c}of all words starting with any number of a's, followed by any number of b's and ending in one or two c's c. The language over the alphabet (a, b, c, d, e, f} where each string starts with a "ab", has either c or d in the middle, and ends with any number of the substring "ef". d. The language over the alphabet (a, b, c) of all words where the words start with either an a or a b followed by as many c's as we want. (the total number or a or b cannot be more that 1) (in any string ther can only be one a or one b) e. The language of only those strings over A= {0, 1} which have exactly 2 zeros

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

IN JAVA Write a function that takes in user input as a string. For all characters which are numeric, double its value and, if it is two digits, then replace it with the sum of its digits (e.g., 6 → 12 → 3 whereas 3 → 6). For all characters which are in uppercase, replace it with lowercase. For all characters which are in lowercase, replace it with uppercase (e.g., m → M and N → n). The program should keep asking the user to enter strings until they either enter ‘q’ or ‘Q’.
please code in python MCQ are a very popular form of assessment because they can be automatically graded…and the students can choose an answer at random if they don’t know.The goal of this exercise is to write a function scoreMCQ(attempt, correct), where attempt is a string that contains the answers of the student and correct is a string with the correct answers.The function should return the number of correct answers.Check first that both strings have the same length, otherwise raise an exception.If both strings are empty the score should be 0 of course.To test your code, you can copy paste the following assert statements as your main function:assert(scoreMCQ("","")==0), "First test failed"assert(scoreMCQ("TFTF","TTTT")==2), "Second test failed"assert(scoreMCQ("TTTT","TTTT")==4), "Third test failed"assert(scoreMCQ("CCCC","ABCD")==1), "Fourth test failed"print("All tests succesfull")
Please &-. Write a Java program to check if a given string is a palindrome or not. A palindrome is a word, phrase, number, or other sequence of characters that reads the same backward as forward, ignoring spaces, punctuation, and capitalization. For example, "racecar" and "Madam" are palindromes, while "hello" and "Java" are not. Your program should take a string as input and return true if it's a palindrome, and false otherwise. Ik.?
i need the answer quickly
Write the following function in Lisp: a function that takes one parameter that you can assume to be a symbol named after a day of the week (no need to check it), such as 'monday, and returns the symbol for the next day. For example, (next-day 'tuesday) should return the symbol 'wednesday. Implement this function with a complex conditional.
A very known application in natural language processing is to extract information from a given text. In this lab, you will be able to extract some emotions (Sad and Happy) from a given string and calculate the score of each emotion. You will be given below the words that express sadness, anger, and happiness. For each word, you will be given weight as well, so that when you are calculating for example the score for sadness in the text (string), you can use this formula:
Examples. Anytime you add something to a base word, such as a prefix or a suffix that adds or changes the meaning of a word, you've added a morpheme. For instance, taco is one morpheme, whereas tacos is two morphemes because the meaning of the word changed when an 's' was added to the end of the word. Write a sentence that includes words with at least one, two and three morphemes. Try not to use the same word. List the words that represent one, two and three morphemes from your sentence below. Write the example sentence: List the words with each morpheme from your example sentence: One morpheme Two morphemes Three morphemes
Computer Science Practice Task : Write a program in phyton language . Implement Water Jug Problem using DFS in Python, initial stage (0,0) and final stage (2,Y). A Water Jug Problem: You are given two jugs, a 4-gallon one and a 3- gallon one, a pump which has unlimited water which you can use to fill the jug, and the ground on which water may be poured. Neither jug has any measuring markings on it. How can you get exactly 2 gallons of water in the 4-gallon jug?