![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
Abstract
In this paper a number of formal schemes for recognizing or generating of translations(binary relations on words)are studied, most of them already being known. Known results are surveyed and new results are obtained on their interrelationships, closure properties, compositions and the preservation of families of languages under such schemes.
For various recognizing schemes(transducers)the equivalent generative schemes(generalized grammars)are exhibited. Also, the equivalence of many generative schemes is shown.