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

draw pda for l={an,bm,an/m,n>=0} n is in superscript

Theorem The class of ?nite languages is a proper subclass of SL. Note that the class of ?nite languages is closed under union and concatenation but SL is not closed under either. N

can you plz help with some project ideas relatede to DFA or NFA or anything

Another striking aspect of LTk transition graphs is that they are generally extremely ine?cient. All we really care about is whether a path through the graph leads to an accepting

s-> AACD A-> aAb/e C->aC/a D-> aDa/bDb/e

Distinguish between Mealy and Moore Machine? Construct a Mealy machine that can output EVEN or ODD According to the total no. of 1's encountered is even or odd.


Theorem The class of recognizable languages is closed under Boolean operations. The construction of the proof of Lemma 3 gives us a DFA that keeps track of whether or not a give

what problems are tackled under numerical integration