Open In App

Aptitude | GATE CS 1998 | Question 57

Last Updated : 12 Oct, 2017
Improve
Improve
Like Article
Like
Save
Share
Report

[Subjective type]

Given a regular expression for the set of binary strings where every 0 is immediately followed by exactly k 1’s and preceded by atleast k 1’s (k is a fixed integer).


Answer:

Explanation:

Quiz of this Question
Please comment below if you find anything wrong in the above post


Like Article
Suggest improvement
Previous
Next
Share your thoughts in the comments

Similar Reads