Two-way coupled finite automata and its usage in translators
Tomáš Hruška, Dušan Kolář, Roman Lukáš, Eva Záčnív aacute · International Conference on Circuits · 2008
This article defines two-way coupled finite automata. Two-way coupled finite automaton enable to make a translation from input language to output language and from output language to input language too. There is discussed deterministic parsing by using coupled finite automaton in this article. For example, this deterministic model can be used for translation between assembly language and a binary code.