(b) The states and stack contents for processing the strings 10#01, 01# 01, 01# 110, and 01# 0110. Are the strings accepted or rejected? (c) The language accepted by the pushdown automata. (Justify this with a sentence or two.) A €, € $ 0, €0 1, 1 B # , € → € 0, € → € 1, € →→ € €, € € 0,0 ➜ € 1,1 →→ € D $→ € E

(b) The states and stack contents for processing the strings 10#01, 01# 01, 01# 110, and 01# 0110. Are the strings accepted or rejected? (c) The language accepted by the pushdown automata. (Justify this with a sentence or two.) A €, € $ 0, €0 1, 1 B # , € → € 0, € → € 1, € →→ € €, € € 0,0 ➜ € 1,1 →→ € D $→ € E

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

Write a CFG to generate the language of all strings that have more a's than b's (not necessarily only one more, as with the nonterminal A for the language EQUAL, but any number more a's than b's). {a aa aab aba baa aaaa aaab ... }
Suppose the action to be taken while parsing a string by the SLR parser is "Reduce A → + T F" where T and F are nonterminals. How many states need to be popped from the stack? a.4 b.3 c.1 d.2
Construct a PDA that matches all strings in the language over {x.y} such that each string has at least twice as many y's as x's. Editor Below, give a short description of the set of strings associated with each state of your PDA.
Construct a CFG and PDA for the language B={w| w is a string over {a,b} with the same count of a's and b's}. For example, abba € B, abab e B,aabb € B, babbbaaaba € B, that is, there is no particular order in which a's and b's appear in w as long as there is the same amount of them.
Construct a PDA that matches all strings in the language over {x,y} such that each string has an odd length and its middle symbol is 'x'. Editor Below, give a short description of the set of strings associated with each state of your PDA.
Let Σ = {0, 1,#}. Show that the following language over Σ is not context-free: {x#y#z: x,y,z = {0,1}* and bin(x) + bin(y) = bin (z)}
L = {w | w contains the string 001 as a substring} Describe the extended transition function on a string recursively using transitions one symbol at a time for the automaton of the above problems. (1) A string (of length >=4) that belongs to the language (2) A string (of length >=4) that does not belong to the language
The language Balanced over E = {(,)} is defined recursively as follows 1. ЛЄ Вalanced. 2. Vx, y € Balanced, both xy and (x) are elements of Balanced. A prefix of a string x is a substring of x that occurs at the beginning of x. Prove by induction that a string x belongs to this language if and only if (iff) the statement B(x) is true. B(x): x contains equal numbers of left and right parentheses, and no prefix of x contains more right than left.
Construct a PDA that matches all strings in the language over {x,y} such that each string has at least twice as many y's as x's.
Formalize the following sentence in english: Vx. (even(X) => divisible_by_two(X))
This question in the OZ programming language: Write two functions which compute the sum of squares of the integers stored in a list. For example, if the input is [1 ~2 3 ~4], the output should be 30. Which of the implementation is better (foldR or foldL) in terms of size of the semantic stack?
write a java code: Consider the following expression BNF: ::= * | / | :== + | - | ::= { }| :: 0|1|2|3|4|5|6|7|8|9 Using recursive descent, and only recursive descent, scan expressions that adhere to this BNF to build their expression tree; write an integer valued function that scans the tree to evaluate the expression represented by the tree. Input: A numeric expression adhering to this BNF. Output: Some representation of the expression tree. The result of evaluating the expression. write a java code for it.