Representation of Recursively Enumerable Languages Using Alternating Finite Tree Recognizers

Kai Salomaa. Representation of Recursively Enumerable Languages Using Alternating Finite Tree Recognizers. In János Csirik, János Demetrovics, Ferenc Gécseg, editors, Fundamentals of Computation Theory, International Conference FCT 89, Szeged, Hungary, August 21-25, 1989, Proceedings. Volume 380 of Lecture Notes in Computer Science, pages 372-383, Springer, 1989.

Abstract

Abstract is missing.