Library

FST · Rational transduction

Morse code for e, t, a, n, i, m, s and o

Every letter is replaced by its code — e is ., t is -, s is ..., o is --- — with / between letters. A substitution of strings for letters is a homomorphism, and a homomorphism is a transducer with a single state.

qe/./, t/-/, a…
The machine as drawn — 1 state, 8 transitions.

The author’s examples, run

a → reject · .-/e → reject · ./aa → reject · .-/.-/ae → reject · .-/./aaa → reject · .-/.-/.-/ttoonomitost → reject · -/-/---/---/-./---/--/../-/---/.../-/