Finiteness of Regular Language

前端 未结 5 1625
醉梦人生
醉梦人生 2020-12-06 09:01

We all know that (a + b)* is a regular language for containing only symbols a and b. But (a + b)* is a string of infinit

5条回答
  •  陌清茗
    陌清茗 (楼主)
    2020-12-06 09:31

    But (a + b)* is a string of infinite length

    No, (a + b)* is a finite way to express an infinite set (language) of finite strings.

提交回复
热议问题