LANGUAGE LOCKSA rule remembered one symbol at a time.

STATE TRAILS

Teach the gates
which trails belong.

A trail starts at Q0 and reads A or B from left to right. Each symbol follows the current state's matching arrow. When the trail ends, its final state decides accept or reject. Repair the arrows and accepting gates to recognize the stated rule.

Try the visible examples, then certify against every trail up to length 7, including examples withheld from the practice list. Empty trail means no symbols: it ends at Q0.

Practice examples

Trace a trail

The state meanings below are suggestions for a valid design. You can build another equivalent recognizer.

Actual finite-state recognition

The pinned noam finite-state engine builds and validates your deterministic machine, reads every test string and decides language membership. Certification uses all 255 binary trails of lengths0through7; the required answer comes from an independent rule predicate. Passing this finite test is a learning checkpoint, not a formal proof for arbitrary length.

Source: izuzak/noam · Apache-2.0 · 228 stars observed30October2026; mature source last changed2024. Original repair missions and GPT gate imagery. License · Notice