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

Gastric juice, what are composition and its function of gastric juice what are composition and its function of gastric juice

Defining strictly local automata, One of the first issues to resolve, when ... One of the first issues to resolve, when exploring any mechanism for defining languages is the question of how to go about constructing instances of the mechanism which define part

Instantaneous description of an fsa, De?nition Instantaneous Description of... De?nition Instantaneous Description of an FSA: An instantaneous description (ID) of a FSA A = (Q,Σ, T, q 0 , F) is a pair (q,w) ∈ Q×Σ* , where q the current state and w is the p

Theory of computation, Computations are deliberate for processing informati... Computations are deliberate for processing information. Computability theory was discovered in the 1930s, and extended in the 1950s and 1960s. Its basic ideas have become part of

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

Overview of dfa, Explain Theory of Computation ,Overview of DFA,NFA, CFG, P... Explain Theory of Computation ,Overview of DFA,NFA, CFG, PDA, Turing Machine, Regular Language, Context Free Language, Pumping Lemma, Context Sensitive Language, Chomsky Normal For

Turing machine , Let ? ={0,1} design a Turing machine that accepts L={0^m ... Let ? ={0,1} design a Turing machine that accepts L={0^m 1^m 2^m } show using Id that a string from the language is accepted & if not rejected .

Problem solving and programming concepts, The Last Stop Boutique is having ... The Last Stop Boutique is having a five-day sale. Each day, starting on Monday, the price will drop 10% of the previous day’s price. For example, if the original price of a product

Transition and path functions, When an FSA is deterministic the set of trip... When an FSA is deterministic the set of triples encoding its edges represents a relation that is functional in its ?rst and third components: for every q and σ there is exactly one

Trees and graphs , Trees and Graphs Overview: The problems for this ... Trees and Graphs Overview: The problems for this assignment should be written up in a Mircosoft Word document. A scanned hand written file for the diagrams is also fine. Be