0 votes 0 votes $L = \{w \mid w \in (0+1)^*, w \text{ is of the form } (0^i 1)^n, i = 1, 2, 3, \ldots n, n \geq 0\}$ Is $L$ regular? Kaluti asked Dec 25, 2017 Kaluti 352 views answer comment Share Follow See all 8 Comments See all 8 8 Comments reply joshi_nitish commented Dec 25, 2017 reply Follow Share it is not regular. infact it is not even CFL. 1 votes 1 votes Ashwin Kulkarni commented Dec 25, 2017 reply Follow Share Can you explain this @nitish? i and n are related or independent? 0 votes 0 votes Ashwin Kulkarni commented Dec 25, 2017 reply Follow Share can't we write is as (0+ 1)* ? 0 votes 0 votes joshi_nitish commented Dec 25, 2017 reply Follow Share @Ashwin, language is like, when n=1, i=1 and strings are (01) when n=2, i=1,2 and strings are (01)2 + (001)2 when n=3, i=1,2,3 and strings are (01)3 + (001)3 + (0001)3 therefore language will look like L= {01 + (01)2 + (001)2 + (01)3 + (001)3 + (0001)3........} 0 votes 0 votes Ashwin Kulkarni commented Dec 25, 2017 reply Follow Share Yes that's what I was asking, i's n and overall n are dependent or not. ok got it bro :) 0 votes 0 votes Ashwin Kulkarni commented Dec 25, 2017 reply Follow Share I was confused because i = 1,2,3 upto n but n is starting from 0. That's why I have assumed them as independent. 0 votes 0 votes Ashwin Kulkarni commented Dec 25, 2017 reply Follow Share @nitish don't you think n>0 0 votes 0 votes joshi_nitish commented Dec 25, 2017 reply Follow Share yes, it should be n>=1... otherwise i=1,2,3....n has no meaning. 2 votes 2 votes Please log in or register to add a comment.