regex - convert NFA to regular expression and tell whether it is multiple of 3? -


I am practicing and just want to confirm that I have correctly spoken and a multi- As to recognize the expression?

Enter image details here

  this is correct Expression and my answer: (AAA) * + (BBB) ​​*) Expression 3 shows a string length multiple by    

+ or (BBB) ​​ + . If you want, you can make it your DFA below:
  __bbb __aa || || One ?? ¼ | One ?? ¼ | - Q º ((Q0)) --- AAA --- â ?? º ((Q1))   

Where Q0 and Q1 are both final states (Q0 starts) state).

Side note: You can replace 'AAA' with label 'AAA' on the side of 'BBB' and 'BBB' so that one can get the other form of the same DFA. In addition, in the standard form of DFA an emblem can be a symbol of one language

Comments

Popular posts from this blog

Pass DB Connection parameters to a Kettle a.k.a PDI table Input step dynamically from Excel -

multithreading - PhantomJS-Node in a for Loop -

c++ - MATLAB .m file to .mex file using Matlab Compiler -