Print Page | Close Window

Questions on toc Printed From: One Stop GATE Category: GATE Technical Discussions Forum Name: GATE CS Forum Discription: General Technical Discussions, Queries, doubts etc. for GATE in CS. URL: http://forum.onestopgate.com/forum_posts.asp?TID=797 Printed Date: 06Mar2025 at 1:42pm Topic: Questions on toc Posted By: vidhya Subject: Questions on toc Date Posted: 28Mar2007 at 12:03am Can some one answer this question in TOC plzz. Which of the following languages are regular sets? Prove your answer. (a) given the alphabet as {0}, {02n | n >= 1} (Zero power 2 power n => 02n) (b) given the alphabet as {0,1}, the set of all strings that do not have three consecutive 0’s (c) given the alphabet as {0,1}, the set of all strings with an equal number of 0’s and 1’s

Print Page | Close Window