Q5. Do only parts b) and c). Exercise 6.2.1: Design a PDA to accept each of the following languages. You may accept either by final state or by empty stack, whichever is more convenient. * a) {0n 1n n ≥ 1}. We shall accept by empty stack. Symbol X will be used to count the 0's on the input. In state q, the start state, where we have seen no l's, we add an X to the stack for each 0 seen. The first X replaces Zo, the start symbol. When we see a 1, we go to state p, and then only pop the stack, one X for each input 1. Formally, the PDA is ({q, p}, {0,1}, {X, Zo}, 8, q, Zo). The rules: 8(q, 0, Zo) = {(q, X)} 8(q,0, X) = {(q, XX)} 8(q, 1, X) = {(p,ɛ)} 8(p, 1, X) = {(p,ɛ)} b) The set of all strings of 0's and 1 's such that no prefix has more l 's than 0's. c) The set of all strings of 0's and 1 's with a n equal number of 0's and I's.

Q5. Do only parts b) and c). Exercise 6.2.1: Design a PDA to accept each of the following languages. You may accept either by final state or by empty stack, whichever is more convenient. * a) {0n 1n n ≥ 1}. We shall accept by empty stack. Symbol X will be used to count the 0's on the input. In state q, the start state, where we have seen no l's, we add an X to the stack for each 0 seen. The first X replaces Zo, the start symbol. When we see a 1, we go to state p, and then only pop the stack, one X for each input 1. Formally, the PDA is ({q, p}, {0,1}, {X, Zo}, 8, q, Zo). The rules: 8(q, 0, Zo) = {(q, X)} 8(q,0, X) = {(q, XX)} 8(q, 1, X) = {(p,ɛ)} 8(p, 1, X) = {(p,ɛ)} b) The set of all strings of 0's and 1 's such that no prefix has more l 's than 0's. c) The set of all strings of 0's and 1 's with a n equal number of 0's and I's.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 1TF

See similar textbooks

Similar questions

L = {w ∈ {a, b}* | at least one prefix of w contains strictly more b’s than a’s.}.For example, baa, abb, abbbaa are in L, but aab, aabbab are not in L. a) Construct a PDA that accepts L by final state.b) Construct a PDA that accepts L by empty stack.
Q#1: In each plastic jar of M&M’s candy, random colored candies are stored. Your little brother/sister likes only the yellow ones, so he/she carefully take out all the yellow candies, one by one, and eats them, and keep the other in order so that he/she can return them to the container, in exactly the same order as they are before, minus the yellow ones. Implement using stack data structure.Using Java.
Problem 2 (Stacks): Consider the fundamental theorem of arithmetic, which is stated as follows:Every positive integer greater than 1 can be written uniquely as a prime or as the product of twoor more primes, where the prime factors are written in order of nondecreasing size. We want touse a stack to read a number and print all of its prime divisors in descending order. For example,with the integer 2100, the output should be:7 5 5 3 2 21. Write an algorithm, called Prime_Factorization, which accepts a positive integer greaterthan 1, and generates its prime factorization according to the above-mentioned theorem.[Hint: The smallest divisor greater than 1 of any integer is guaranteed to be a prime.]2. Propose a stack class to accommodate this prime decomposition. It should have at leasttwo member functions: One to compute the prime factorization of an integer, and one toprint all corresponding prime divisors in descending order.3. Give an implementation of all member functions defined in…
Machine organization The following operations are performed on a stack: PUSH A, PUSH B, POP, PUSH C, POP,POP,PUSH D, PUSH E, POP, PUSH F. What does the stack contain after each operation?
Consider the following stack, which can be written as [70, 10, 50, 80, 20] i.e. the "top" of the stack is the first element in the list Consider the following code (written as pseudocode): myfunction( stack1 ) stack2 = createStack() while stack1 is NOT empty value = top(stack1) pop(stack1) while stack2 is NOT empty and top(stack2) > value push(stack1, top(stack2)) pop(stack2) push(stack2, value) print(stack2) // Prints the current stack as [element_1, element_2, ..., element_n] return stack2 From the answers below, select the correct output for the first 4 print statements if myFunction is executed with: myFunction( [ 70, 10, 50, 80, 20] )
Code in C One of the applications of a stack is to backtrack - that is, to retrace its steps. As an example, imagine we want to read a list of items, and each time we read a negative number we must backtrack and print the five numbers that come before the negative number and then discard the negative number. Use a stack to solve this problem. Use a stack and push them into the stack (without printing them) until a negative number is read. At this time, stop reading and pop five items from the stack and print them. If there are fewer than five items in the stack, print an error message and stop the program. After printing the five items, resume reading data and placing them in the stack. When the end of the file is detected, print the message and the items remaining in the stack. Sample Output 1 2 3 4 5 6 7 -1 7 6 5 4 3 9 6 4 3 -2 3 4 6 9 2 -3 Number of items left is less than five! Program is terminating! Project name : Backtrack Filenames: backtrack.h, backtrack.c,…
Machine organization question The following operations are performed on a stack :PUSH A, PUSH B, POP, PUSH C, POP,POP,PUSH D, PUSH E, POP, PUSH F.What does the stack contain after each operation?
2) Write a recursive program to obtain the nth order Fibonacci sequence number.Include appropriate input/output statements to track the variables participating inrecursion. Do you observe the “invisible” stack at work? Record your observations.3) Implement a program to evaluate any given postfix expression. Test yourprogram for the evaluation of the equivalent postfix form of the expression(−(? ∗ ?)/?) ↑ ? + ? − ? ∗ ? ∗ ? for A = 1, B = 2, D = 3, C = 14, E = 110, F = 220,H = 16.78, I = 364.621.
Java Files Recursive.java RecursiveDemo.java The purpose of the assignment is to practice writing methods that are recursive. We will write four methods each is worth 15 points. a- int sum_sqr_rec(stack<int> stk) which will receive a stack of "int" and output the sum of the squares of the elements in the stack. b- int plus_minus_rec(stack<int> stk) which will receive a stack of "int" (example: {a,b,c,d,e,f,g,h,i,j}) and output the sum of the elements in the stack as follows: a - b + c - d + e - f + g - h + i -j c- void prt_chars_rev_rec(stack<char> stk) which will receive a stack of "char" and print its elements in reverse. d- void prt_chars_rec(queue<char> stk) which will receive a queue of "char" and print its elements Remember to use the stack and queue STL. The Assignment will require you to create 2 files: Recursive.java which contains the details of creating the 4 methods as specified above: int sum_sqr_rec(stack<int> stk), (15 points)…
Project 4: Maze Solver (JAVA) The purpose of this assignment is to assess your ability to: Implement stack and queue abstract data types in JAVA Utilize stack and queue structures in a computational problem. For this question, implement a stack and a queue data structure. After testing the class, complete the depth-first search method (provided). The method should indicate whether or not a path was found, and, in the case that a path is found, output the sequence of coordinates from start to end. The following code and related files are provided. Carefully ready the code and documentation before beginning. A MazeCell class that models a cell in the maze. Each MazeCell object contains data for the row and column position of the cell, the next direction to check, and a bool variable that indicates whether or not the cell has already been visited. A Source file that creates the maze and calls your depth-first search method. An input file, maze.in, that may be used for testing. You…
Answer the given question with a proper explanation and step-by-step solution. Hello team, Need some help with problems below using the langauge JAVA. I need to modify the CalcParser class provided below. I need this to produce a string containing commands to evaluate the expression on a stack machine. For example, if you give the command java CalcParser 1+2*3, the output should be a sequence of stack commands such as this: push 1.0 push 2.0 push 3.0 multiply add 7.0 For the command java CalcParser (1+2)*3, on the other hand, it should print a sequence like this: push 1.0 push 2.0 add push 3.0 multiply 9.0 CODE:public class CalcParser { private CalcLexer lexer; private String errorMessage = null; private double value; public CalcParser(String s) { lexer = new CalcLexer(s);errorMessage = lexer.getErrorMessage();if (errorMessage != null) return; value = parseExpression();if (errorMessage != null) return; match(CalcLexer.EOLN_TOKEN);if (errorMessage != null) return; } public String…
(2) Answer the following questions concerning lists, stacks, and queues Please be thorough with explanatio! (d) Suppose you are implementing a list of stacks. Let's say you decide to implement both the general list (the list of stacks) and each individual stack using a double linked list. Assume that there are currently N stacks in the list, and each stack has a maximum of K items, where N and K are both large. You are going to iterate through the general list and apply a single operation to each stack as you encounter it. Now answer the following four questions, using big-Theta notation: What is the average-case time complexity of pushing one additional item into each stack? What is the worst-case time complexity of pushing one additional item into each stack? What is the average-case time complexity of popping one item from each stack? What is the worst-case time complexity of popping one additional item from each stack? (For pops, if the stack is empty, you can assume that the pop…