John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence
Paper
Decidability of second-order theories and automata on infinite trees
Abstract
In this paper we solve the decision problem of a certain second- order mathematical theory and apply it to obtain a large number of decidability results. The method of solution involves the development of a theory of automata on infinite trees—a chapter in combinatorial mathematics which may be of independent interest.
Related
A.R. Conn, Nick Gould, et al.
Mathematics of Computation
Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings
Conference paper
Channel coding considerations for wireless LANs
Daniel J. Costello Jr., Pierre R. Chevillat, et al.
ISIT 1997