Consider the language L defined by the following grammar with productions S-> AB A -> a | Ab B-> b| Ba Which of the following statements are true for all sentences of L? Each sentence contains exactly as many a's as b's. Each sentence contains one or more b's. Each sentence contains at least two letters. O Each sentence contains one or more a's. O All as precede all b's.

Consider the language L defined by the following grammar with productions S-> AB A -> a | Ab B-> b| Ba Which of the following statements are true for all sentences of L? Each sentence contains exactly as many a's as b's. Each sentence contains one or more b's. Each sentence contains at least two letters. O Each sentence contains one or more a's. O All as precede all b's.

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

I need help in these question relating to Context Free Grammar
Question 2 c) Give a regular expression for the following regular languages, assuming the alphabet is Σ := {0, 1}. I. The set of all strings, when viewed as binary representation of integers, that are divisible by 2. II. The set of all strings containing 00. III. Give a closed-form regular expression for the set of all string not containing consecutive 00.
find the context-free grammar that represents the language that is accepted by this given PDA
You are given a context free grammar G and a string S. Find the minimum Levenshtein distance between S and any string W accepted by G. The first line of the input contains two space-separated integers Vand R denoting the number of non-terminals and the number of productions of G The following Rlines describe productions. Each line starts with an integer Tdenoting the production type. If T=0, a space and three space-separated integers X, Yand Z denoting a production X→YZ If T=1, a space, an integer X, another space and a character cdenoting a production X→c If T=2, a space and a single integer Xdenoting a production X→ε The next line contains a single integer ST denoting the starting symbol of G. Last line contains the string S as explained in statement. Input: 5 7 0 0 1 2 0 0 3 4 2 0 1 1 a 1 3 b 0 4 0 3 0 2 0 1 0 ababb Output: 2
2. Morphology, syntax (a) In German, the ending of a regular verb in present tense is normally t for third person singular, unless the stem ends on t or d, in which case the ending is et. Examples are: stem 3rd sing. lern lernt arbeit arbeitet red redet Draw a finite-state transducer that maps a stem to this verb form. To be precise, the input is the stem of a regular verb followed by the symbol #, and the output is the third person singular present tense form of that stem, without the final #. As transition label you can use the abbreviation other, which is short for a:a, b:b, c:C, e:e, ..., that is, a mapping from any letter (other than t or d) to that same •.•/
Computer Science Let L = { w e {a,b,c}*: w has a substring 'aa' and a substring 'ab'} a. Find a NFA for L o. Give a regular expression for L. c. Find a right linear grammar for L.
We have introduced some languages involving DFA/NFA that are decidable. For example, we have introduced EDFA = {{B)|B is a DFA and L(B) = Ø}, which can be decide by a TM DEDFA . We can construct TM DEDFA in this way: given (B), DEDFA will mark the states of B to check whether finally any accept state can be marked. Furthermore, we have used this TM DEDFA to construct a TM decider for another language EQDFA = {{A,B)| A,B are DFAS and L(A) = L(B)}. See the allowed lecture slides for details. Now, follow this idea, use this DEDFA to construct another Turing machine DSUB that decide the language SUBDFA = {(A,B>| A,B are DFAS, L(A) C L(B)}.
Given: Language L2 = {w e {a,b}* | w contains substring aab} Construct the DFA representing the given language L2. Assume the layout of the DFA is as follows: ->A->B->C->D*. That is, the number of states are four (4) and A is the starting state and D is the accepting state. What is the next state for input pair (D,b) in the constructed DFA? A В C D
2. Are the following languages context-free or non-context-free? • If a language is context-free, give a context-free grammar that generates it. • If a language is not context-free, prove this using the pumping lemma. A = { a*b'c*d² |k > i > 0, l>0 } B = {a²i+1fk+1c3l (2k+1q* | i > 1, k > 1, l > 1 } (a) (b)
Can you please help me with this problem because I don't understand how to do this, can you please do it step by step and show something visual that shows why it is ambiguous or not and then can you explain in detail why it is ambiguous or not.