Assignment 1. Design Push Down Automata for the following language, Consider E= {a,b} L= {w| w is a string of (a,b)* where number of 'a' and number of 'b' is not equal} Hints: The string can contain 'a and b' in any combination (star * operation). But the number of 'a' and 'b' will be unequal in the accepted string. Some example strings: aabbababa, bbbaabaabbbb, bababababab, aaaaaaaba etc.

Assignment 1. Design Push Down Automata for the following language, Consider E= {a,b} L= {w| w is a string of (a,b)* where number of 'a' and number of 'b' is not equal} Hints: The string can contain 'a and b' in any combination (star * operation). But the number of 'a' and 'b' will be unequal in the accepted string. Some example strings: aabbababa, bbbaabaabbbb, bababababab, aaaaaaaba etc.

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

3. Given the following BNF grammar: -> d c | cd -> a la -> b | b Use the top-down recursive descent method which we discussed in the class to implement a parser (i.e. tdrd.parser.py) in python3 for the above BNF grammar. The input data file name is given from the command line. You may assume that there is a space character between two terminals (e.g. a a adc b ) in the data file.
Write the context-free grammars for the following languages. 1. The set of strings of a's and b's that contain the same number of a's and b's (in any order). | 2. L = {a* b° a | z =x+y}, that is the set of strings of x number of a's followed by y number of b's and then followed by z number of a's, satisfying the condition z =x+y.
Q No. 3: Grammar G1 = ( N = { E, T, F, I, D}, T = { +, *, (, ), 0-9}, S = {E} and P is the set of productions: E E +T | T T T * F | F E) | I DI | D F I D + 0|1|2|3|4 |5 | 6 | 7 | 8 |9 For the string w = (9*(9+9)+999), find- 1. Leftmost derivation 2. Rightmost derivation 3. Parse Tree
1. Design a pushdown automaton for the following language, L={a^b²n:n>0}.
Create a context free grammar for each of the followinglanguages.a. L = { a i b j | i < j }b. L = { a i b j ck d l | 0 < j < i, 0 < l < k }c. L = { a i b j ck d l | i = l, j < k }
Eliminate left recursion from the following grammar: E ::= E + E | E - E | E * E | E / E | num | ( E ) Where num is a terminal symbol representing any number.
Languages L2 is defined by symbols Σ={0,1}, written as follows: L2={w| w contains N number of 1 followed by N number of zeros} Q) Design a NFA that accepting the language L2. Write the formal definition as 5 tuples.
1. Convert the following regular grammar into a Finite Automata S➜X XXXIXY Y➜yylyz 2-22 12 2. Convert the previous problem to a regular expression. 3. Write a grammar that generates an even number of X's.
Q1: B/ construct grammar represent the language of all strings over the alphabet a; b with equal number of a's followed by equal number of b's.
Construct an NFA that recognizes each of the following languages. c. ? = {? ∈ {?, ?, ?} ∗ | ? starts and ends with a different symbol} Please answer the question by drawing it out with states labeled as q0, q1, q2, etc. Please label the start states and end states clearly. Please label the transitions clearly as well. Thank you.
Formal Languages and Automata Theory Let G = (V, Σ, R, S) be the following grammar. V = {S, T, U}; Σ = {0, #}; andR is the set of rules:
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.