Skip to content
Tape‑n‑Trace
PracticeSearch 26 tools

← All games

No more zeros than ones

Is L = { 0ⁿ1ᵐ : n ≤ m } regular?

you attack · engine defends

Engine · move 1

The engine claims L = { 0ⁿ1ᵐ : n ≤ m } is regular and announces a pumping length of n = 5. Choose a string in the language with at least 5 symbols.

You · move 2

w ∈ L, |w| ≥ 5