Praison AI

Finite Automata for L1

—

by

Zach I

A finite automata that accepts the set L1 of binary strings such that any 1’s are preceded by one or two 0’s.