The Gateway to Computer Science Excellence
+2 votes
105 views
L1= {uvw | u,v,w belongs {a,b}*

& |u| =|v| =|w| }

a)regular

b)cfl

c)csl

d) recursive

 

answr is regular?.

why it is regular?
in Theory of Computation by
edited by | 105 views
+2

because L1 can be rewritten as,

L1 = {w | w $\epsilon$ (a+b)* , |w|mod3 = 0 }, which is regular.

0

language will be ((a+b)*)n.((a+b)*)n.((a+b)*)n

Cancatenation of  3 equal length string

yes string will be mod3 and regular

1 Answer

+1 vote

$L_1$ can be written simply as $\{ x : x \in (a+b)^*, |x|mod3 = 0\}$.

Therefore it is regular.

by
0
thnx
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
52,315 questions
60,427 answers
201,752 comments
95,227 users