A Morphic Representation of Complements of Recursively Enumerable Sets
暂无分享,去创建一个
Andrzej Ehrenfeucht | Grzegorz Rozenberg | Keijo Ruohonen | A. Ehrenfeucht | G. Rozenberg | K. Ruohonen
[1] Andrzej Blikle. Proving Programs by Sets of Computations , 1974, MFCS.
[2] Jeffrey D. Ullman,et al. Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.
[3] Joost Engelfriet,et al. Equality Languages and Fixed Point Languages , 1979, Inf. Control..
[4] Hideyuki Takahashi. The Maximum Invariant Set of an Automaton System , 1976, Inf. Control..
[5] Arto Salomaa,et al. On the Decidability of Homomorphism Equivalence for Languages , 1978, J. Comput. Syst. Sci..
[6] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .
[7] Seymour Ginsburg,et al. Algebraic and Automata Theoretic Properties of Formal Languages , 1975 .
[8] Joseph S. Ullian,et al. Three Theorems Concerning Principal AFLs , 1971, Journal of computer and system sciences (Print).
[9] Arto Salomaa. Equality sets for homomorphisms of free monoids , 1978, Acta Cybern..
[10] Willem P. de Roever,et al. On Backtracking and Greatest Fixpoints , 1977, ICALP.
[11] Joost Engelfriet,et al. Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages , 1980, JACM.