The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
49 views
Language {w | ww=www} is regular.

How and what is this language?
asked in Theory of Computation by Loyal (6.4k points) | 49 views
+3

gaurav ...

Question:-  Langaugae containing such string W such that...

for this W following condition must satisfied..

WW=WWW(concatenation)....and i think for this scenario only some(finite) string exist...like epsilon

1 Answer

+1 vote

The language will contain ONLY One String and that is Null String(Epsilon). Because for Any other string, ww can never be equal to www.

Thus, Regular.

answered by Boss (18.4k points)


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

39,823 questions
46,798 answers
140,946 comments
58,883 users