Regular Expresion to DFA Online

Parse tree method

by Deidr047
Write epsilon

To write epsilon, you can type "", '', ϵ\epsilon or εε.

Supported grammars:
  • (a)(a)
  • abab
  • a∣ba|b
  • a∗a*
  • a+a+
  • a?a?
  • ε\varepsilon (epsilon character)
Valid examples:
  • ab?c(a∣b)+ab?c(a|b)+
  • (0∣1)+(0|1)+
  • (d∣b∣c∣a∣ε)(d∣b)d∗(d|b|c|a|ε)(d|b)d*
  • ((0∣1)+∣(a∣b)+)∗(iloveyou)?((0|1)+|(a|b)+)*(iloveyou)?
How this works? And the rules of the method:

If you have questions about the rules of this method, please visit this GeeksForGeeks webpage (GeeksForGeeks you are the best :D):

https://www.geeksforgeeks.org/regular-expression-to-dfa/

If you need further information about how this application works, go to this site.