0 votes 0 votes What is regular language and does it can accept any string? tejas96 asked Sep 20, 2018 tejas96 518 views answer comment Share Follow See 1 comment See all 1 1 comment reply Swapnil Naik commented Sep 20, 2018 reply Follow Share Any language which can be recognized using finite state machine is called regular language. To accept a string by a finite state machine, that string must be present in its language. Every finite language is regular language and if a language is infinite then it may or may not be a regular language. eg. L = {ab,aabb,aaabbb,aaaabbbb,...................} anbn n>0, this is not regular as it is infinite and we can't track no. of a's appeared before b's, to match same no. of occurrences. L = {ab,aabb,aaabbb,aaaabbbb, aaaaabbbbb} anbn 0>n>6 , here language is finite implies we can create an automaton to construct a finite state machine, hence a regular language. 0 votes 0 votes Please log in or register to add a comment.