๐ณ 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 |
Search
Dec 18, 2024, 1 min read
= a ๐ฆพ State machine, representing a function mapping each admissible finite input ๐ Word to a finite output ๐ Word
| Name | Storage |
|---|---|
| ๐ Finite state transducer | none |
| โฆ see ๐ช Chomsky Hierarchy |