Some Characterization of Recursively Enumerable Sets

References

• Brandenburg , F. J. 1987 . Representations of languages families by homomorphic equality operations and generalized equality sets . Theor. Computer Sd. , 55 : 183 – 263 .
   Web of Science ®Google Scholar
• Brandenburg , F. J. 1984 . “ A truely morphic characterization of recursively enumerable sets ” . In Proceedings MFCS'84 , 205 – 213 . Czechoslovakia : Praha .
   Google Scholar
• Eilenberg , S. 1974 . Automata, languages, and machines , Vol. A. , New York and London : Academic Press .
   Google Scholar
• Foryá , W. 1986 . Fixed point languages of rational transductions . Semigroup Forum , 34 : 177 – 183 .
   Web of Science ®Google Scholar
• Kuich , W. and Salomaa , A. 1986 . Semirings, automata, languages , BerlinHeidelberg-New York-Tokyo : Springer-Verlag .
   Google Scholar
• Lallement , G. 1979 . Semigroups and combinatorial applications , New York-Chichester-Brisbane-Toronto : J. Wiley and Sons .
   Google Scholar
• Latteux , M. and Timmerman , E. 1988 . Bifaithful starry transductions . Information Processing Letters , 28 : 1 – 4 .
   Web of Science ®Google Scholar
• Leguy , J. 1981 . Transductions rationnelles décroissantes . Informatique Théorique et Applications (RAIRO} , 15 : 141 – 148 .
   Google Scholar
• Nivat , M. 1968 . Transductions des langages de Chomsky . Ann. de l'Inst. Fourier , 18 : 339 – 456 .
   Google Scholar
• Salomaa , A. 1973 . Formal languages , New York and London : Academic Press .
   Google Scholar
• Salomaa , A. 1985 . Computation and automata , Encyclopedia of Mathematics, 25 Cambridge : Cambridge Univ. Press .
   Google Scholar