M bê thế lãnguage over {a, f} accepting all štřings so that: 1. There are precisely two e's in the string. 2. Every a is immediately followed by an even number of f's. 3. Every c is immediately followed by an odd number of b's. 4. b's and f's don't occur except as provided in rules 2 and 3. 5. All a's occur after the first e. 6. All c's occur before the second e. 7. In between the two e's there are exactly half as many a's as c's. onstruct a context-free grammar generating M. You do not need an inductive proof, I ould explain how your construction accounts for each rule. e could eliminate one rule from m to make it regular. Which one? Why?

M bê thế lãnguage over {a, f} accepting all štřings so that: 1. There are precisely two e's in the string. 2. Every a is immediately followed by an even number of f's. 3. Every c is immediately followed by an odd number of b's. 4. b's and f's don't occur except as provided in rules 2 and 3. 5. All a's occur after the first e. 6. All c's occur before the second e. 7. In between the two e's there are exactly half as many a's as c's. onstruct a context-free grammar generating M. You do not need an inductive proof, I ould explain how your construction accounts for each rule. e could eliminate one rule from m to make it regular. Which one? Why?

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

Related questions

Q: (a) Write an element from the set A x B x C. (b) Write an element from the set B x Ax C. (e) Write…

A: It is defined as a branch of mathematics involving discrete elements that uses algebra and…

Q: Q3: Superheroes Supervillains are tired of Toronto condo rental prices, so they are leaving Toronto…

A: import bisectnumberOfSuperHeroes = int(input())# reading names of super heroesnames =…

Q: Suppose that in a certain programming language numbers are constructed ac-cording to the following…

A: Introduction: A context-free grammar is a set of production rules that define a language. In this…

Q: Problem 2 Let L be the language over the alphabet Σ = {a,b,c} that consists of exactly those strings…

A: The language L described in the given conditions is not regular

Q: Question 4a: Construct a DFA which accepts all strings over A = {a, b, c, d, e, f, g} which have…

A: DFA short for Deterministic Finite Automata is a machine with a fixed number of states which accepts…

Q: Prove that the following language L is not contextfree: L {0"- 1"0" | n20 }.

A: please do upvote for my efforts! answer: we can use pumping lemma to prove it

Q: Draw an FA accepting the language of all strings containing no more than one occurrence of the…

A: A finite automata can be denoted as a five-element abstract machine, it has a set of states and…

Q: Briefly explain null-terminated string

A: Null terminated string A null terminated string is a character string that is stored as an array.…

Q: 5. a. Write a lambda expression for a Comparator that compares strings in increasing order of their…

A: Here I have created the list of strings and added 5 values to the list. Next, I have created the…

Concept explainers

Bare bones programming language

Bare bones programming language is a low-level programming language that gives a detailed stepwise description of a program. It has a tight program design and in-depth understanding of the toolchain. It is based on the target environment and is used for safe coding practices. C programming language is a type of bare bones programming language.

Question

Let M be the language over {a, b, c, d, e, f} accepting all strings so that:
1. There are precisely two e's in the string.
2. Every a is immediately followed by an even number of f's.
3. Every c is immediately followed by an odd number of b's.
4. b's and f's don't occur except as provided in rules 2 and 3.
5. All a's occur after the first e.
6. All c's occur before the second e.
7. In between the two e's there are exactly half as many a's as c's.
Construct a context-free grammar generating M. You do not need an inductive proof, but you
should explain how your construction accounts for each rule.
We could eliminate one rule from m to make it regular. Which one? Why?

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

6. Haskell function show (show:: (BST a)) -> String) is defined by a Haskell deriving Show clause and it operates as follows. instance Show a => Show (BST a) where show Nil = "Nil" show (Node x Nil Nil) = "Node " ++ (show x) ++ " Nil Nil" show (Node x Nil right) = "Node " ++ (show x) ++ " Nil (" ++ (show right) ++ ")" show (Node x left Nil) = "Node " ++ (show x) ++ " (" ++ (show left) ++ ") Nil" show (Node x left right) = "Node " ++ (show x) ++" (" ++ (show left) ++ ") (" ++ (show right) ++ ")" (i) Explain the recursion of function show in general BST terms. (ii) Assume that function show is applied to a BST of height 2 containing strings consisting of single letters a, b, c, d, e, f, g inside its nodes (a BST respecting lexicographic ordering). Write down the string constituting the outcome of its operation.
Q3) Give regular expressions for the following languages,where the alphabet is S = {0, 1}. --all strings of one or more 0’s followed by a 1 --all strings of two or more symbols followed by three or more 0’s
Finish the 2 "TODO" in the ASM Language! A palindrome is a word that is spelled the same way forwards and backwards. For example, "radar", "racecar", "civic", "kayak", and "madam" are all palindromes. The definition can be extended to phrases and sentences when ignore case and punctuation, but for this exercise we will stick to a single word. The starter code provided uses the C library functions printf and scanf to prompt for an input a word. The word that is entered from the keyboard is a null-terminated string placed in the byte array at address buf. There are also two output strings provided at addresses str_is_palindrome and str_is_not_palindrome. The starter code provided simply outputs the string at str_is_not_palindrome. The code contains two TODO comments... At the first TODO comment, the byte array at buf is filled with input from the keyboard. This input is a null-terminated character string (i.e. the array contains the characters entered on the keyboard, followed by ASCII…
The following two languages over {a,b} L1: All strings that contains at least two 'b's L2: All strings that has an 'a' as the second to last character of the string
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…
Theory of Computation homework Please help me understand how to do this with as much information as possible please. I have finals coming up and I need to understand how to properly do these questions and I really don't understand it. Thanks in advance. I will upvote if the answer returned is correct and got enough information for me to understand.
Define a LISP function MONTH->INTEGER which takes as argument a symbol that should be thename of a month, and which returns the number of the month. For example:(MONTH->INTEGER 'MARCH) => 3 (MONTH->INTEGER 'JUNE) => 6If the argument is not a symbol that is the name of a month, the function should return the symbolERROR. For example:(MONTH->INTEGER 'C) => ERROR (MONTH->INTEGER 7) => ERROR(MONTH->INTEGER 'QUOTE) =>ERROR (MONTH->INTEGER '(MAY)) =>ERROR
Problem Statement: An election is a formal group decision-making process by which a population chooses a candidate by casting votes. Each candidate is assigned name and a specific symbol. A ballot paper is used to cast the vote. Each ballot paper contains symbols of the candidate. A person can vote a candidate by stamping on a specific symbol. The ballot paper should be considered as a spoilt ballot if a person does not stamp or stamp on more than one symbol. Finally ballot paper has to be dropped in a ballot box. Write a C++ program that reads the information from the user to enter the name of the candidate, the total number of received votes, and the spoilt votes in a local election. The total number of participants (candidates) are 5. If the user mistakenly enters any negative value, the program should consider that value as a positive integer. The program should output the name, total received votes, and the percentage of obtained votes by the winning candidate. The program should…
DFA Design
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.
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.
The following two languages over {0,1} L1: All strings that begin in '00' L2: All strings that have the substring '1' embedded.