Q1: Write down regular expressions for each of the following languages. Assume Σ = {0, 1} • The language containing strings where Os and 1s always appear in pairs. For example - 001100, 1100110011001100 etc. • The language containing strings which starts and ends with differnt characters. • The language containing strings in which the number of 1s between every pair of consecutive Os is even.

Q1: Write down regular expressions for each of the following languages. Assume Σ = {0, 1} • The language containing strings where Os and 1s always appear in pairs. For example - 001100, 1100110011001100 etc. • The language containing strings which starts and ends with differnt characters. • The language containing strings in which the number of 1s between every pair of consecutive Os is even.

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

Explain with an example the situation where using read() is appropriate andalso an example where readlines() is appropriate.
1. Determine |A|, where: {z} b. A = {{z}} _d. A = {z, {z}, {z, {z}}} _e. A = P({z}) _f. A = P({Ø,z}) a. A = _c. A = {z, {z}}
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.
b) Let E = {the letters/symbols of your own name} Suppose you want to construct the following language: "The set of all strings that accept any string of your last name length but will not accept your last name as a string." Draw a corresponding NFA. My Name is Abdul Baten
Please write Lisp code for the following problem. Consider the list:(name (number1 nation)) (MusicPurchasedNorway) (Pressfreedom Norway) (NobelliterWinners France)(MovieTixHighPrices Switzerland))write a function to access the MovieTixHighPricesvalue using carand cdr.? (Your function should work on any property list with this set of properties in this order.)
The following two languages over {0,1} L1: All strings that begin in '00' L2: All strings that have the substring '1' embedded.
3. Give the following FAs over the alphabet Σ ={0,1,2} a-) A DFA for { strings in which the number of even digits is odd} b-) A DFA for { strings, when interpreted as a base-3 number, are even numbers } c-) A DFA for { strings, when interpreted as a base-3 number, are even numbers having odd number of even digits } d-) A DFA for { strings, when interpreted as a base-3 number, are not an even number} e-) An & -NFA for {], when interpreted as a base-3 number, is an even number} (@: reverse of @ )
Please solve in Python 3: As a software engineer, you are hired to arrange cricket players based on their country and type. You have given all the player’s information in a tuple called my_tuple. The players are from 3 countries which are Bangladesh, Australia and England. There are 2 types of players which are “Batters” and “Bowlers”You are given the following nested tuple where each element in the my_tuple is a tuple consisting of a name and a 4 digit ID.my_tuple = (("Mominul", 1101),("Mustafiz", 1202),("Bell", 2101),("Cook", 2103),("Smith", 3101),("Finch", 3102),("Starc", 3203), ("Imrul", 1103), ("Taijul", 1204))Write a python program that will convert this tuple into the following dictionary using the process described below: Your code should work for all types of similar tuple if the sample input is changed.Output dictionary (You just have to print the resultant dictionary. No need to follow the pattern below){'Bangladesh': { 'Batters': ('Mominul', 'Imrul'), 'Bowlers':…
Assignment Content Given two strings s and t, determine if they are isomorphic. Two strings s and t are isomorphic if the characters in s can be replaced to get t. All occurrences of a character must be replaced with another character while preserving the order of characters. No two characters may map to the same character, but a character may map to itself. Example 1: Input: s="egg", t = "add" Output: true Example 2: Input: s="foo", t = "bar" Output: false Example 3: Input: s= "paper", t = "title" Output: true
Output the information as a formatted histogram. Each name is right justified with a width of 20. Ex: Jane Austen ****** Charles Dickens ******************** Ernest Hemingway ********* Jack Kerouac ********************** F. Scott Fitzgerald ******** Mary Shelley ******* Charlotte Bronte ***** Mark Twain *********** Agatha Christie ************************************************************************* Ian Flemming ************** J.K. Rowling ************** Stephen King ****************************************************** Oscar Wilde *
Python function called dict that takes as input a python dictionnary x and a chain of caracters a, and returns the translation. If a is in English, the function returns the translation in French. If a is in French, the function returns the translation in French. If a is not in the French or English dictionary, the function returns “unknown”. x = {“car”: “voiture” , “pen”: “stylo”, “cream”: “crème”} Example of function: >> Dict(x, “voiture”) ‘Car’ >>Dict(x, “Solei”) ‘Unknown’
Problem D: Oinkway Pig Latin is a language constructed by transforming English words. The following rules are used to translate English into Pig Latin: If the word begins with a consonant, then all consonants at the beginning of the word, up to the first vowel are removed then added to the end of the word, followed by "ay". For example, "computer becomes "omputercay" and "think" becomes "inkthay". If the word begins with a vowel, then "way" is added to the end of the word. For example, "algorithm" becomes "algorithmway" and "office" becomes "officeway". If the word ends in a punctuation mark, then the punctuation mark should remain at the end of the word after the transformation has been performed. For example, "science!" should become "iencescay!". You can assume that the punctuation mark is only a single character. Create a program that reads a line of text from the user, translates it into Pig Latin and then displays the result. Hint: Making a set of vowels and consonants of the…