let G=(V,T,S,P) where V={a,b,A,B,S}, T={a,b},S the start symbol and P={S->Aba, A->BB, B->ab,AB->b} 1.show the derivation sentence for the string ababba
2. find a sentential form from this grammar

Posted Date: 10/27/2012 9:27:30 PM | Location : United States

Ask an Expert

Related Discussions:- automaton theory, Assignment Help, Ask Question on automaton theory, Get Answer, Expert's Help, automaton theory Discussions

Write discussion on automaton theory
Your posts are moderated

Write your message here..

Related Questions

Hhhhhhhhhhhhhhhhh, Ask question #hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh... Ask question #hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhMinimum 100 words accepted#

Formal languages and grammar, The universe of strings is a very useful medi... The universe of strings is a very useful medium for the representation of information as long as there exists a function that provides the interpretation for the information carrie

Class of recognizable languages, Proof (sketch): Suppose L 1 and L 2 are ... Proof (sketch): Suppose L 1 and L 2 are recognizable. Then there are DFAs A 1 = (Q,Σ, T 1 , q 0 , F 1 ) and A 2 = (P,Σ, T 2 , p 0 , F 2 ) such that L 1 = L(A 1 ) and L 2 = L(

Automata, As we are primarily concerned with questions of what is and what ... As we are primarily concerned with questions of what is and what is not computable relative to some particular model of computation, we will usually base our explorations of langua

Describe the algorithm and draw the transition diagram, 1. Simulate a TM wi... 1. Simulate a TM with infinite tape on both ends using a two-track TM with finite storage 2. Prove the following language is non-Turing recognizable using the diagnolization

Turing machine, Can v find the given number is palindrome or not using turi... Can v find the given number is palindrome or not using turing machine

Computations of sl automata, We will specify a computation of one of these ... We will specify a computation of one of these automata by specifying the pair of the symbols that are in the window and the remainder of the string to the right of the window at ea

Myhill-nerode theorem, The Myhill-Nerode Theorem provided us with an algori... The Myhill-Nerode Theorem provided us with an algorithm for minimizing DFAs. Moreover, the DFA the algorithm produces is unique up to isomorphism: every minimal DFA that recognizes

REGULAR GRAMMAR, Find the Regular Grammar for the following Regular Express... Find the Regular Grammar for the following Regular Expression: a(a+b)*(ab*+ba*)b.

Formal language theory, This was one of the ?rst substantial theorems of Fo... This was one of the ?rst substantial theorems of Formal Language Theory. It's maybe not too surprising to us, as we have already seen a similar equivalence between LTO and SF. But