automaton theory, Theory of Computation

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







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
Related Questions
Find the Regular Grammar for the following Regular Expression: a(a+b)*(ab*+ba*)b.

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

The computation of an SL 2 automaton A = ( Σ, T) on a string w is the maximal sequence of IDs in which each sequential pair of IDs is related by |- A and which starts with the in

To see this, note that if there are any cycles in the Myhill graph of A then L(A) will be infinite, since any such cycle can be repeated arbitrarily many times. Conversely, if the

i have some questions in automata, can you please help me in solving in these questions?

Computation of a DFA or NFA without ε-transitions An ID (q 1 ,w 1 ) computes (qn,wn) in A = (Q,Σ, T, q 0 , F) (in zero or more steps) if there is a sequence of IDs (q 1

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

Paths leading to regions B, C and E are paths which have not yet seen aa. Those leading to region B and E end in a, with those leading to E having seen ba and those leading to B no

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

We developed the idea of FSA by generalizing LTk transition graphs. Not surprisingly, then, every LTk transition graph is also the transition graph of a FSA (in fact a DFA)-the one