Theory of Computation: Finite Automata
Regular Expression I was wondering if the operation of regular expression (Union, Concatenation, Star) is complete. This question needs further prompt: In what sense do I mean complete? Am I asking: -