為由 01 或 010 組成的語言設計正則表達式或有限自動機? [英]Design a regular expression or Finite Automata for a language that consists of 01 or 010?