Q.1: In each case below, find a CFG generating the given language. a. The set of odd-length strings in {a, b}* with middle symbol a. b. The set of even-length strings in {a, b} * with the two middle symbols equal. c. The set of odd-length strings in {a, b}* whose first, middle, and last symbols are all the same.

Q.1: In each case below, find a CFG generating the given language. a. The set of odd-length strings in {a, b}* with middle symbol a. b. The set of even-length strings in {a, b} * with the two middle symbols equal. c. The set of odd-length strings in {a, b}* whose first, middle, and last symbols are all the same.

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

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
given the strings s1 and s2, not necessarily of the same lenght, create a new string consisting of alternating characters of s1 and s2 (that is, the first character of s1 followed by the first character of s2, followed by the second characters of s1, followed by the second character of s2, and so on. Once the end of either string is reached, the reminder of the longer string is added to the end of the new string. For example, if s1 contained "abc" and s2 contained"uvqxyz", then the new string should contain "aubvcwxyz". Assign the new string to the variable s3. using python and loops
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 finite sequence of symbols from a given alphabet will be called a string over the alphabet. A string that consists of a sequence a1, a2, a3, a4, … … … … , ?? of symbols will be denoted by the juxtaposition a1 a2 a3 a4 … … … … ??. Given the strings: ? = a2bab2and v = bab2, Evaluate the following operations for strings: (i) ԑu(ii) u + v(iii) u(u| v)(iv) v | (v | u)
Write regular expressions for the following languages. By “word”, we mean an alphabetic string separated from other words by whitespace, any relevant punctuation, line breaks, and so forth. (a) The set of all alphabetic strings;(b) The set of all lower case alphabetic strings ending with a letter b;(c) The set of all strings with two consecutive repeated words (e.g., “Humbert Humbert” and “the the” but not “the bug” or “the big bug”);(d) All strings that start at the beginning of the line with an integer and that end at the end of the line with a word;(e) All strings that have both the word grotto and the word raven in them (but not, e.g., words like grottos that merely contain the word grotto);
Build a DFA that accepts the set of string over {a,b} in which the number of a’s is divisible by three.
1] Draw the DFA for all strings that have at least one 0 over the alphabet{0,1} and write the RE. 2] Draw the DFA for the set of all strings which starts from 10 and ends with any number of 1's and write the RE.
Ancay youyay eakspay igpay atinlay? (Can you speak pig latin?) If you can’t, here are the rules: If a word begins with a consonant, take all of the letters before the first vowel and move them to the end of the word, then add ay to the end of the word. Examples: pig → igpay, there → erethay. If a word begins with a vowel (a, e, i, o, u, or y), simply add yay to the end of the word. For this problem, y is always a vowel. Examples: and → andyay, ordinary → ordinaryyay. Although there are many variants of Pig Latin (such as Kedelkloppersprook in Germany), for this problem we will always use the rules described above. A friend of yours was frustrated with everyone writing in Pig Latin and has asked you to write a program to translate to Pig Latin for him. Ouldway youyay ebay osay indkay otay oday ityay? (Would you be so kind to do it?) Inputs consist of lines of text that you will individually translate from a text file given by the user. If the file cannot be opened for some reason,…
Write a program in c++ in which we have 3 strings and we have to print them continuously without using + and concat. You can assume any three strings
NLP Q#2: Write regular expressions for the following languages. By "word", we mean an alphabetic string separated from other words by whitespace, any relevant punctuation, line breaks, and so forth. 1. the set of all strings with two consecutive repeated words (e.g., "Humbert Humbert" and "the the" but not "the bug" or "the big bug"); 2. all strings that start at the beginning of the line with an integer and that end at the end of the line with a word; 3. all strings that have both the word grotto and the word raven in them (but not, e.g., words like grottos that merely contain the word grotto); 4. Demonstrate a pattern to check if the email address is valid. 5. Demonstrate a pattern to verify the validity of a phone number, and check if it belongs to the Pakistani Mobile Network. 6. Demonstrate a RE to remove symbols and non-alphanumeric characters from the string paragraph. 7. Demonstrate a RE to remove URLs and HTML tags from the text string.
Given a string str, find the length of the longest substring without repeating characters. (a).For “ABDEFGABEF”, the longest substring are “BDEFGA” and “DEFGAB”, with length 6. (b).For “BBBB” the longest substring is “B”, with length 1.For “GEEKSFORGEEKS”, (c).there are two longest substrings shown in the below diagrams, with length 7 write code in python
b Convert the following infix strings to suffix string using the Reverse PolishNotation (RPN). i. A + (B * C) / D = M – N * P; ii. U = P*Q*R /( K+J); iii. I = P*Q* R* (V +D);