在语言上具有na(w)和nb(w)的确定性有限自动机正则表达式 [英]Deterministic Finite Automata Regular Expression with na(w) and nb(w) over a language
为由 01 或 010 组成的语言设计正则表达式或有限自动机? [英]Design a regular expression or Finite Automata for a language that consists of 01 or 010?