Given the following DFSM M, the correct statements are:Sa, ba,bT□ (aa Uab Uba U bb)* is a regular expression that generates L(M).(ab Uba)* is a regular expression that generates L(M).□S → E, S → aT, S→ bT, T→ aS, T→ bS are the regular grammar rules that generate L(M).SaT, S→ bT, TaS, TbS are the regular grammar rules that generate L(M).

The acronym DFSM represents "Deterministic Finite State Machine." A DFSM, also called a DFA…

Given the following DFSM M, the correct statements are: S a,b a,b T (aa Uab Uba U bb)*" is a regular expression that generates L(M). (ab Uba)* is a regular expression that generates L(M). OS→ E, SaT, S→ bT, T→aS, TbS are the regular grammar rules that generate L(M). SaT, S→ bT, T→aS, TbS are the regular grammar rules that generate L(M).

Given the following DFSM M, the correct statements are: S a,b a,b T (aa Uab Uba U bb)" is a regular expression that generates L(M). (ab Uba) is a regular expression that generates L(M). OS→ E, SaT, S→ bT, T→aS, TbS are the regular grammar rules that generate L(M). SaT, S→ bT, T→aS, TbS are the regular grammar rules that generate L(M).

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

2. If L is a regular language over E, what can be said about the languages L1 = E* – L and L2 = reverse(L*)? A. Li is always regular but not L2. B. L2 is always regular but not L1. C. Li and L2 are both regular. 3. What is the language generated by the grammar G: { S → aR , R → aR| baR|b }? A. (aa*b)* B. (a*b)(a*b)* C. (aa*b)(aa*b)* 4. IfL is a regular language over some alphabet E, what can be said about the language L’ = (E* – L) N reverse(L)? A. L' is surely regular. B. L’ is surely non-regular. C. Its type cannot be determined without additional information. 5. Including the trap state, how many states are there in the minimum-state DFA for the regular expression (a+b)*(b+c)* ? Also how many final states will there be in the minimum-state DFA? A. 4 states with one final state B. 3 states with two final states C. 3 states with one final state
ANNSWER BY TRUE OF FULSE: (No need to explain as I already know the answer but I want to check my answers. i. For every regular language, G, there exists a push down automata, M such that L(G)=L(M). ii.The following grammar represents the language of all strings over the alphabet a and b, with the total number of a’s being equal to the number of b’sS → aSb | aabb iii. The following languages MUST at least be defined by Pushdown Automata L = {ab, abab, ababab, abababab, ...}. iv. The correct CFG for the language L = (aa + bb)* isS → aB | bA | λ;A → aS;B → bS.
What can be claimed about the grammar G: {S→ alaRb, R→ b|bSa }? OA. G is a context-free grammar and L(G) is a context-free language. B. G is a context-free grammar but L(G) is actually a regular language. O C. G is a regular grammar and L(G) is a regular language. What can be said about the grammar G: {S → ORO|OR1|1RO|1R1, R → E|OR|1R }? OA. G is a context-free grammar and L(G) is a context-free language. B. G is a context-free grammar but L(G) is the regular language (0+1)²(0+1)* C. G is a regular grammar and L(G) is the regular language (0+1)(0+1)*
Let G = (V, E, R, S) be a grammar with V= {S, H, Gm J}; = {h, g. j}; and the set of rules: H>h | hJG G> Gg | Sg | HgJ J→ jH | HHJ| Jj Convert this grammar to a PDA using the method we described.
Consider a grammar for expressions is defined as follows:<assign> → <id> = <expr><id> → A | B | C | D<expr> → <id> + <expr>| <id> * <expr>| ( <expr> )| <id>Give a recursive descent algorithm for the BNF defined above.You may abstract away some details and are expected to make your answer using pseudo code.
Answer the given question with a proper explanation and step-by-step solution. Using the algorithm discussed in class, ”Big loop algorithm” show the transition diagram for a pushdown automaton (PDA) to recognize the language generated by G, which ahs the following grammer rules S →BAC A →a | b | c | ε B →bB | b C →cC | ε Fully define for the grammar G above, that is G = (....Describe in English what language the grammar G generates . Give an example showing that the grammar G above is ambiguous
NAT Lang processing: Please explain in detail Consider a CFG representing a phrase structure grammar for a natural language such as English, including the following rule (the period is part of the rule): S -> NP VP . In this rule, S, NP, and VP are non-terminal symbols, but we will assume that the period is a terminal symbol specifically representing a period (as opposed to some other end-of-sentence marker). So, we can interpret this rule as stating that a sentence can have the form of a noun phrase followed by a verb phrase followed by a period. (To implement a parser for grammars with rules like this, the tokenizer would have to treat periods as separate tokens.) Assume that you need to convert this grammar to Chomsky normal form (CNF), perhaps with the CKY parsing algorithm in mind. Using the procedure discussed in class, show the rules that might result from the conversion.
For each of these languages, give both a context-free grammar and a push down automaton. Briefly explain how your CFG and PDA work. Your CFG should be relatively simple and contain at most 6 variables. For this question, your PDA cannot be directly convertedfrom your CFG (a)L1={ x#y | x is a prefix of yR, and y∈{a,b}* } ,Σ ={a,b,#} Recall that wR is w written backwards, and u is a prefix of v if v=ut for some stringt.For example bb#abb is in L1, but a#ab is not. (b)L2={ aibjck | i ≥ j or j ≥ k } (c)L3 = {w∈{a,b}* | w contains an unequal number of a’s and b’s}
This question is about context-free grammars and parsing, and Turing machines (TM’s). Question 1) Consider the following context-free grammar G over the alphabet Σ = {a, b, c}: S → aSb | ε | acSba | abc Using any of the grammar transformation techniques we saw in this module, construct a CNFgrammar that generates the same language as the grammar G of Question 1.Make sure you include in your answer all individual steps that you followed. Please help me with this question :)
boolval denotes the token for Boolean literal (e.g., true, false). A denotes the Boolean AND operator, and O denotes the Boolean OR operator. You are given the following BNF grammar: → boolval | A | 0 (a) Draw the parse tree of this expression: A true O 0 false true A true false (b)According to the token(s) and the grammar rule(s) mentioned in the beginning of Question 2, write a grammar file that can be used in SableCC.
1)Let G = (V, ∑, R, S) be a grammar with V = {S, H, Gm J}; ∑ = {h, g, j}; and the set of rules: S → H H → h | hJG G → Gg | Sg | HgJ J → jH | HHJ| Jj a)Convert this grammar to a PDA using the method we described. b)Convert G to Chomsky normal form.
Hello I need help in theoretical computer science Let G be a grammar with the start variable S that describes a language using the alphabet Σ = {a, b, c} and whose rule set contains the following rules: • S ⇒ ABC, • A⇒aa and A⇒AA, • B ⇒ b, • C⇒c and C⇒CC. Show that the language L (G) is right-linear.