The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
42 views
xx^r /x=[0,1]* , |x|=l

Here we have restriction that on length of x should be exactly l

If only the language is given How can we say that l is finite or infinite

In one of the videos they have taken subsets of l also 2^l , how can this language be Regular and CFL

plzz explain each point properly
asked in Theory of Computation by (275 points) | 42 views
0
I am even unable to get the question properly.

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

40,840 questions
47,502 answers
145,758 comments
62,259 users