if you can design a DFA that accepts the language, it's regular.
Consider this DFA:
Starting state S
Accepting states A and S
Rejecting state B
S -- [0] --> S
S -- [1] --> A
A -- [0] --> B
A -- [1] --> A
B -- [0] --> B
B -- [1] --> B
Copyright © 2024 1QUIZZ.COM - All rights reserved.
Answers & Comments
Verified answer
if you can design a DFA that accepts the language, it's regular.
Consider this DFA:
Starting state S
Accepting states A and S
Rejecting state B
S -- [0] --> S
S -- [1] --> A
A -- [0] --> B
A -- [1] --> A
B -- [0] --> B
B -- [1] --> B