Abstract

The early work of Kobrinskii and Trakhtenbrot (1965) and of Buchi (1962) established an “equivalence” between the monadic second-order theory of finite linear orders and the regular sets — in the following sense: (+) Regular sets are exactly those definable in a second-order monadic predicate language.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.