i don't know about prefix,suffix and prefix property....please provide a detailed description about this!

The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

0 votes

Define init (L) = {set of all prefixes of L}

Let L = {w | w has equal number of 0’s and 1’s}, Ʃ = {0,1}

init (L) is:

(a) all binary strings with unequal number of 0’s and 1’s

(b) all binary strings with ԑ-string

(c) all binary strings with exactly 1 more 0’s than the number of 1’s

or one more than number of 0’s

(d) None of above

Let L = {w | w has equal number of 0’s and 1’s}, Ʃ = {0,1}

init (L) is:

(a) all binary strings with unequal number of 0’s and 1’s

(b) all binary strings with ԑ-string

(c) all binary strings with exactly 1 more 0’s than the number of 1’s

or one more than number of 0’s

(d) None of above

- All categories
- General Aptitude 1.5k
- Engineering Mathematics 7.1k
- Digital Logic 2.7k
- Programming & DS 4.9k
- Algorithms 4.2k
- Theory of Computation 5.3k
- Compiler Design 2.1k
- Databases 4k
- CO & Architecture 3.5k
- Computer Networks 4k
- Non GATE 1.4k
- Others 1.5k
- Admissions 556
- Exam Queries 551
- Tier 1 Placement Questions 23
- Job Queries 69
- Projects 18

47,894 questions

52,260 answers

182,168 comments

67,679 users