A Morphic Representation of Complements of Recursively Enumerable Sets

Authors:
A. Ehrenfeucht;G. Rozenberg;K. Ruohonen
Affiliations:
Department of Computer Science, University of Colorado, Boulder, CO;Institute of Applied Mathematics and Computer Science, University of Leiden, 2300 RA Leiden, Holland;Institute of Mathematics, Tampere University of Technology, SF-33101, Tampere 10, Finland
Venue:
Journal of the ACM (JACM)
Year:
1981

Formal languages

Formal languages
Theory of recursive functions and effective computability

Theory of recursive functions and effective computability
Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages

Journal of the ACM (JACM)
Algebraic and Automata-Theoretic Properties of Formal Languages

Algebraic and Automata-Theoretic Properties of Formal Languages
Proving Programs by Sets of Computations

Proceedings of the 3rd Symposium on Mathematical Foundations of Computer Science
On Backtracking and Greatest Fixpoints

Proceedings of the Fourth Colloquium on Automata, Languages and Programming
Formal languages and their relation to automata

Formal languages and their relation to automata

Hi-index	0.00