Deterministic finite automata Question:

Set of strings over {0, 1} that contain the substring 1010 followed by (not necessarily immediately) the substrings 111 and 101 in any order

Note: 101011101 should be accepted (111 and 101 share a 1).

Testing Case:

a = accepting/final state , r = rejecting

1010111101 a 1010101111 a 101011101 a 101010111 a 01010111101 a 01010101111 a 0101011101 a 0101010111 a 0001010000111000101000 a 0001010000101000111000 a 1011010111101 a 1010 r 111 r 101 r 1010111 r 1010101 r 1010110010 r 101010101 r 1111011010 r 1111010111 r ^ r 101011111 r