Give pushdown automata for the languages in question 1.Note: Some of these languages are regular (every regular language is also a context-freelanguage). Therefore, you will not need a stack for recognizing them. That is, a finiteautomaton will suffice for recognizing each of these languages. Give context-free grammars that generate the following languages. In all parts the alphabetΣ is {0, 1}.a) {w € Σ* | w contains at least two Os}b) {w € * | the length of w is even}c) {w ¤ Σ* | w starts and ends with the same symbol}d) {w € Σ* | the length of w is odd and its middle symbol is a 1}e) The empty setf) The empty string

As per our guidelines we are suppose to answer only one question, kindly post other questions as…

Give context-free grammars that generate the following languages. In all parts the alphabet Σ is {0, 1}. a) {w € Σ* | w contains at least two Os} b) {w € Σ* | the length of w is even} c) {w ¤ Σ* | w starts and ends with the same symbol} d) {w € Σ* | the length of w is odd and its middle symbol is a 1} e) The empty set f) The empty string

Give context-free grammars that generate the following languages. In all parts the alphabet Σ is {0, 1}. a) {w € Σ* | w contains at least two Os} b) {w € Σ* | the length of w is even} c) {w ¤ Σ* | w starts and ends with the same symbol} d) {w € Σ* | the length of w is odd and its middle symbol is a 1} e) The empty set f) The empty string

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

Implement a complete class in c ++ code that represents a priority queue. The gender must contain the operations enqueue and dequeue, with the usual semantics.Indicate the complexity of all operations with motivation.
Given a multi-dimensional data set, implement a program in a language ofyour choice that supports the pointer data structure, to construct a k-d tree for thesame.
Implement a complete class in c ++ code that represents a stack. The stack must contain the operations push (e) and pop (): e, with standard semantics. Both operations must be 0 (1).Your only restriction is that you may not use the class <T> from std ::
Implement a complete class in c ++ code that represents a priority queue. The gender should contain the operations top (): e, pop (), and push (e) with reasonable semantics. Describe the complexity of all operations.You can use all aids from the default library except std :: priority_queue.
Consider a language that does not have arrays but does have stacks as a data type. That is, one candeclare stack s; and the push, pop, popandtest and stacktop operations are defined. Show how a onedimensional array can be implemented by using these operations on two stacks.
Define the rule echo(LST0, LST1). This rule describes LST1, which holds all the same elements as LST0, except that they are all repeated. You should expect LST0 and LST1 to always be nonempty lists. Please answer in GNU prolog
Implement a complete class in c ++ code that represents a stack. The stack must contain the operations push (e) and pop (): e, with standard semantics. Both operations must be 0 (1).
in java, Two abstract data types are the ordered list and the unordered list. Explain how these two ADTs are similar and how they differ. To answer this question, assume that you do not know how they are implemented (that is, whether they are implemented using an array or a linked list).
A 2-stack automaton is similar to a stack automat, but can handle twobatteries at the same time (that is, put conditions on both batteries and modify themsimultaneously).a. Formally define a 2-stack automatonb. Define how to accept a stringc. Define the language you acceptd. To test all of the above, draw the 2-stack automaton that can recognize the language ? ^ ? ? ^ ? ? ^ ?.
2 ASAP PLEASE.... Define a Haskell instance of the Functor class for the following type of binary tree with data in nodes and leaves: The definition should be used as below.data Tree a = Leaf a | Node a (Tree a) (Tree a) Note: I need code for exactly as above, noooooooooooooo expalanations, just code for above.
Implement a complete class in c ++ code that represents a stack. The stack must contain the operations push and pop with ordinary semantics. Both operations must be 0 (1).
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.