Construct a DFA which accepts the language { x in {0,1}* | x has
a 0-symbol in every odd position }. Odd positions contain the first
symbol, the third symbol, the fifth symbol, and so on.
I've seen the same question posted in here before but they are all
incorrect answers. Please give me a correct one.
Construct a DFA which accepts the language { x in {0,1}* | x has a 0-symbol in every odd position }. Odd positions conta
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am