4 votes 4 votes Which one is Regular? 1)$L_{1}=\left \{ a^{x}b^{y}c^{z} | \left ( x=y\vee y=z \right ) \wedge x+y+z\leq 100\right \}$ 2)$L_{2}=\left \{ a^{x}b^{y}c^{z} | \left ( x=y\vee y=z \right ) \wedge x+y+z\geq 100\right \}$ Theory of Computation theory-of-computation regular-language + – srestha asked Dec 30, 2017 srestha 351 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments joshi_nitish commented Dec 30, 2017 reply Follow Share L1 is regular (finite no. of strings) L2 is NCFL 3 votes 3 votes hacker16 commented Dec 31, 2017 reply Follow Share @aditya for L2, there is NPDA, which is going to accept this. You can easily construct it. just give it a try. 0 votes 0 votes Kaluti commented Jan 2, 2018 reply Follow Share i also think first one is regular and second one is ncfl 0 votes 0 votes Please log in or register to add a comment.