Regular languages #

Any language specifiable by regular expression or finite automata.

RE to NFA #

Building blocks

Example #

(0+1)*1