Draw the transition diagrams for push-down automata for the following languages. Give direct constructions, not conversions from CFGS, and give a brief description in English of your strategy for each problem. (a) {a*b'c* : 2i = k or i = j+1} (b) {w E {a, b}* : Na(w) = ns(w) and for every prefix v of w, we have na(v) > no(v)}

Draw the transition diagrams for push-down automata for the following languages. Give direct constructions, not conversions from CFGS, and give a brief description in English of your strategy for each problem. (a) {ab'c : 2i = k or i = j+1} (b) {w E {a, b}* : Na(w) = ns(w) and for every prefix v of w, we have na(v) > no(v)}

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

Q4: Let Σ = {0, 1, #} and define a language B over Σ as follows: B = {r#s: r,s = {0, 1}^*, r is a substring of s}. Prove that the language B is not context free
Draw the transition diagrams for push-down automata for the following language.Give direct constructions, not conversions from CFGs, and give a brief description inEnglish of your strategy for each problem.
Design a PDA for the following language: L = {0*1³ | 0 < i < j < 2i}. Hint: remember we showed PDAS both for {a"b"} and {a"b?"}. However, to allow the string to have that range of number of b's, you need to use the nondeterminism: for each 0 push a symbol in the stack and allow the PDA to non-deterministically choose to match 1 or 2 b's to each a.
Use the Pumping Lemma to show the following language L is NOT regular. L= {w E (a, b, c}* ; where w has equal number of a's, b's, and c's}
Construct npda that accept the following languages on Σ = {a, b, c}: L = {wcwR : w ∈ {a, b}∗}.
Consider the following grammar and eliminate left recursion- S-A A → Ad / Ae / aB / ac B > bBc / f ww wwww
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.
L = {am+n bm cn | m,n ≥ 1} over Σ = {a, b, c} A. Design PDA for L (with as less as states possible) B. Is L is regular language? C. Verify it by Pumping Lemma
need help in automata, Please Show the equivalent moves on the pushdown acceptor as a series of configuration moves leading to acceptance.
L={a"b"a" | n,m=1,2,3.} is given. i) Write a CFG for the language L. ii) Construct a push down automata (PDA) model that accepts L. (PLEASE USE THE NOTATION GIVEN IN THE TEXTBOOK WHILE DRAWING THE PDA, PDA's CONSTRUCTED USING OTHER NOTATIONS WILL NOT BE EVALUATED.) iii) Show the leftmost derivation for the string aaaabbbaaaa. iv) Draw the derivation tree for the string aaaabbbaaaa.
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
A → aAB| a B → ABb | b 5. Find out each of the tuples of the following Push Down Automata (PDA). Convert the following PDA that is accepted by final state to its equivalent PDA accepted by empty stack. b.x/A d,x/A d,x/A