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} 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
We'll close our consideration of regular languages by looking at whether (certain) problems about regular languages are algorithmically decidable.

How useful is production function in production planning?

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.

distinguish between histogram and historigram

The generalization of the interpretation of strictly local automata as generators is similar, in some respects, to the generalization of Myhill graphs. Again, the set of possible s

Another way of representing a strictly 2-local automaton is with a Myhill graph. These are directed graphs in which the vertices are labeled with symbols from the input alphabet of

The k-local Myhill graphs provide an easy means to generalize the suffix substitution closure property for the strictly k-local languages. Lemma (k-Local Suffix Substitution Clo

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