1 votes 1 votes L= { $a^n$$b^n$ , n<10000 } it is regular language as still states are finite means we have create around 20000 states but still states are finite so it is regular . AM I GOING IN RIGHT DIRECTION ????? Deepanshu asked Dec 13, 2018 Deepanshu 244 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Gupta731 commented Dec 13, 2018 reply Follow Share But how we will keep a track on the equality of $a$ and $b$ 0 votes 0 votes kumar.dilip commented Dec 13, 2018 reply Follow Share Yes, it is regular.it will take finite memory. 1 votes 1 votes Deepanshu commented Dec 13, 2018 reply Follow Share is my approach correct kumar.dilip 0 votes 0 votes kumar.dilip commented Dec 13, 2018 reply Follow Share Yes. Even $a^{n}b^{n}c^{n} , n < 10000$ is regular. 1 votes 1 votes Please log in or register to add a comment.
Best answer 2 votes 2 votes yes it is regular, only finite number of string is present. and every finite language is always regular. abhishekmehta4u answered Mar 30, 2019 • selected Mar 31, 2019 by srestha abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.