Finite State Machine

Apakah string ini termasuk dalam L?

L = { x ∈ (0+1)⁺  |  x ends with 1  &  x has no substring "00" }
State transition diagram
start 0 1 0 1 0 1 0, 1 S A B C accept state trap state
Input string
x =
Examples to try
✓ Should accept
✗ Should reject
Result
?
Awaiting input
Enter a binary string above and click Check

FSM Checker  ·  Finite Automata Theory  ·  L = { x ∈ (0+1)⁺ | last char = 1, no "00" }