🕳 Transducer (machine) §

= a 🦾 State machine, representing a function mapping each admissible finite input 🈁 Word to a finite output 🈁 Word

Classification §

Name	Storage
🛠 Finite state transducer	none
… see 🪜 Chomsky Hierarchy