Emulator

Normal Markov algorithm

Enter a word and substitution rules, then run the algorithm step by step or all at once.

Workspace

up to 1000 steps

Input word the result will appear here

Substitution rules no more than 32 rules

Editor

Execution progress

Execution log

→

Ordinary rule

The rule α->β replaces the first occurrence of α with β and continues.

↦

Terminal rule

The rule α=>β makes the substitution and immediately stops the algorithm.

1…

Order matters

At each step, the first matching rule is applied from top to bottom.

Ready-made example

For the alphabet A = (a, b) append the symbol a to the end of the word: abb → abba.