On the Decidability of MSO+U on Infinite Trees

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-662-43951-7_5
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg