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

Automata subject? Q 1: Create R.E for a language where no substring should end with “ab” defined over Σ = {a, b}
8. Build a DPDA that accepts the language L = {(ab)" (aab)b² n ≥0
Finish the 2 "TODO" in the ASM Language! A palindrome is a word that is spelled the same way forwards and backwards. For example, "radar", "racecar", "civic", "kayak", and "madam" are all palindromes. The definition can be extended to phrases and sentences when ignore case and punctuation, but for this exercise we will stick to a single word. The starter code provided uses the C library functions printf and scanf to prompt for an input a word. The word that is entered from the keyboard is a null-terminated string placed in the byte array at address buf. There are also two output strings provided at addresses str_is_palindrome and str_is_not_palindrome. The starter code provided simply outputs the string at str_is_not_palindrome. The code contains two TODO comments... At the first TODO comment, the byte array at buf is filled with input from the keyboard. This input is a null-terminated character string (i.e. the array contains the characters entered on the keyboard, followed by ASCII…
remove left recursion from the following grammar: S S a S|U U UuU|T T t|f|T n| (S)
Design a PDA for the language L = {we {a,b} *:na(w)=nb (w)}, where n a (w) = the number of a's that appear in the string w. Apo
Ʃ = {a, b} Construct the DFA for the language in which every ‘a’ is ether immediately preceded by or immediately followed by ‘b’. Also specify what information each state represents. Some sample strings in the language baab, aba, bbabb Some sample stings NOT in the language aaa, aab
The language composed of all strings over the alphabet {a,b} of the form: zero or more a's followed by zero or more b's, i.e., {"", a, b, aa, ab, bb, aaa, aab, abb, bbb, ...}, where "" is the empty string, is a regular language: show why this is. Note that you may use any line of argument on regular languages, e.g., by showing that it can be constructed using the properties ("Regular Language: a formal definition"), or by drawing the finite state automaton (FSA), or giving its description.
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.
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.
C++ Consider the language that the following grammar defines: <S> = c | <W> | c<S> <W> = abb|a<W>bb Write all strings that are in this language and that contain seven or fewer characters. If the answer includes multiple strings, you must enter the answers in alphabetical order. A. In alphabetic order, what are the two strings in this language that are 3 characters in length? B. In alphabetic order, what are the two strings in this language that are 4 characters in length? C. In alphabetic order, what are the two strings in this language that are 5 characters in length?
Using Java, write a program that reads as input an arbitrary context-free grammar from a text file and then derives/enumerates five strings from the grammar. The file cfg.txt can be used to test your program. The grammar represented in cfg.txt is the following grammar for non-palindromes (from input alphabet {a,b}): S -> aSa | bSb | XX -> aYb | bYaY -> aY | bY | lambdaThis is formatted in cfg.txt as follows: S aSaS bSbS XX aYbX bYaY aYY bYY *An asterisk is used for lambda. Assume that the first state listed in the input file is the start state. Read the grammar into a map (aka hash or dictionary) where the key is a variable and the value is a list of right-hand sides. If you are using Java, you could use Hashtable by declaring a Hashtable of the following type:Hashtable<String, ArrayList<String>>Do not write the program specific to this grammar in cfg.txt. Further, assume that the test file will have more than three variables, and productions on the right hand side…
Eliminate left recursion in the following grammar Sb/C > Aa