Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I just want to get a second opionion on these expression and whether they are irregular or regular.
{0^n 1^m | n >= m >=0} REGULAR
{0^n 1^m | n,m >=0}* REGULAR
{0^n 0^n | n>=0} IRREGULAR
can anyone confirm that this is true?
{0^n 1^m | n >= m >=0}Since an FSM cannot keep track of what n was in order to ensure n>=m, an FSM cannot represent the expression.{0^n 1^m | n,m >=0}*— an FSM can seem to represent this but there are problems. Unlike the first problem, n and m are unrelated to one another so no FSM creation issues. The problem is that n and m must remain the same for multiple passes through the machine. Again, since there’s no memory, this isn’t possible.{0^n 0^n | n>=0}— this is simple with an FSM as well. It looks much like the 2nd problem’s FSM. The RE is(00)*