in Theory of Computation
39 views
0 votes
0 votes

Find grammar for the language on $\sum$={a}

L={w | |w|  mod 3>0}

is this correct?

S->aA

A->aB | $\varepsilon$

B->aS | $\varepsilon$

in Theory of Computation
by
59 points
39 views

2 Comments

yes, correct
0
0
edited by
yes it is correct

It yields L = {a,aa, aaaa , aaaaa ,….} for W or | W | mod3 > 0 for alphabet = {a}
0
0

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.