retagged by
2,653 views
2 votes
2 votes
1. The complement of a finite language is always infinite

2. The complement of an infinite language may be finite or infinite ..

both statements are true .. i can proof using examples .. can someone give me logical theory proof ?
retagged by

3 Answers

1 votes
1 votes
1. The set of all strings generated by an alphabet is infinite. If our given set is finite, then we have infinity - something finite which is always infinite.

2. This is similar to 1 except that we have infinity - infinity which is undefined, it can be finite or infinite depending on the size of infinity. For example both the set of points on the real line and the set of points on the cartesian plane are infinite but the cartesian plane has infinite points for every point on the real line  { picking 2 on the x-axis defines a line in the cartesian plane but defines a point on the real line)
1 votes
1 votes
let us take a example of language

A.L{xɛ{0,1}* ǀ 00 act as a sub string}

so if we take its complement then it will infinite string all those string which does not had 00 as substring which is infinite

B.just think conversely the complement of infinite language which is above in the example may or may not had finite elements.

I THIMK THIS IS SUFFICIENT.
0 votes
0 votes
If you are good at 'Set theory' then always consider language is 'set of elements' then i can guess , it would be easy to answer such questions.

1) Take any finite set S={1,2} now ask yourself what would be S' ?

Infinite- finite = infinite.

2) can you predict infinite-infinite = ?    No, you can't say anything .

Related questions

2 votes
2 votes
0 answers
2
1 votes
1 votes
1 answer
3
Xylene asked Jul 15, 2017
1,088 views
From rice theorem, I know that it is not recursive. But can someone prove that ? Or atleast give some intuitive proof?
0 votes
0 votes
1 answer
4
thor asked Nov 17, 2016
464 views
Does every DCFL(not grammar) has LL(1) grammar.??Does every DCFL has LR(1) grammar ?