Skip to content
Related Articles

Related Articles

Aptitude | GATE CS 1998 | Question 57

Improve Article
Save Article
Like Article
  • Last Updated : 12 Oct, 2017

[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).



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

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!