in Theory of Computation
44 views
1 vote
1 vote
Find DFA on $\Sigma =(a,b)$ for

L={ w : $(n_{a}(w)-n_{b}(w))mod3>0$ }
in Theory of Computation
by
59 points
44 views

7 Comments

This problem is slightly tricky, and depends on how you define the mod function.

Look here and you’ll see what I mean.

1
1
I’ve a doubt in the question itself

Can I write like this?

$n_{a}mod3-n_{b}mod3>0$

So, $n_{a}mod3>n_{b}mod3$
0
0
I don’t think you can, I think what you can do is take the absolute value of the difference and then take modulus 3.
0
0
but why not?
0
0

e.g take a string like b, it’ll give you -1 you’ll have to reject that, which is a problem and makes the language not regular.

1
1
then can we consider this?
$\left | n_{a}mod3-n_{b}mod3 \right |>0$
1
1
Yes, you can.
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.