A Morphic Representation of Complements of Recursively Enumerable Sets-Reference-Cited by-同舟云学术

A Morphic Representation of Complements of Recursively Enumerable Sets

Published:1981-10 Issue:4 Volume:28 Page:706-714
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Ehrenfeucht A.¹,Rozenberg G.²,Ruohonen K.³

Affiliation:

1. Department of Computer Science, University of Colorado, Boulder, CO

2. Institute of Applied Mathematics and Computer Science, University of Leiden, 2300 RA Leiden, Holland

3. Institute of Mathematics, Tampere University of Technology, SF-33101, Tampere 10, Finland

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference13 articles.

1. Lecture Notes in Computer Science 28;BLIKLE,1975

2. the decidability of homomorphlsm eqmvalence for langul J;CULIK K.;Comput. Syst. Sci.,1978

3. SemanUcs ofinfimte processes using generalized trees In Mathemaucal Founda of Computer Science 1977, Lecture Notes in Computer Science 53, J. Gruska, Ed;DE BAKKER J.W;Spnnger-Ve Berlin,1977

4. ENGELFRIET J. AND ROZENBERG G. Equahty languages and fixed point languages Inf. Conm (1979) 20-49. ENGELFRIET J. AND ROZENBERG G. Equahty languages and fixed point languages Inf. Conm (1979) 20-49.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Turing Machines with One-sided Advice and Acceptance of the co-RE Languages;Fundamenta Informaticae;2017-08-03

2. Preface;Theoretical Computer Science;2012-04

3. On morphically generated formal power series;RAIRO - Theoretical Informatics and Applications;1995

4. On generalized DT0L systems and their fixed points;Theoretical Computer Science;1994-05

5. Representations of language families by homomorphic equality operations and generalized equality sets;Theoretical Computer Science;1987-12