简体   繁体   中英

Regular Expression to Deterministic Finite Automata

How would you convert this RE to a DFA?

(a+aab)*b

I'm having trouble drawing the state diagram for this one. I'm not sure where to start, especially with the arbitrary number of a's involved.

it does not respect exactly the proper format for DFA but you can use the following (very bad) drawing as a starting point.

In order to respect the standard format, you can move each letter to the curves/lines pointing to the rectangle containing it and replace the letters in the rectangles by the state numbers q1, q2, q3, etc. (this should be straightforwards)

在此处输入图片说明 Good luck!

The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.

 
粤ICP备18138465号  © 2020-2024 STACKOOM.COM