Boundedness of Monadic Second-Order Formulae over Finite Words

14 years 3 months ago

Abstract. We prove that the boundedness problem for monadic secondorder logic over the class of all finite words is decidable.

Achim Blumensath, Martin Otto, Mark Weyer

Finite Words | ICALP 2009 | Monadic Secondorder Logic | Programming Languages |

claim paper

Added	16 Aug 2010
Updated	16 Aug 2010
Type	Conference
Year	2009
Where	ICALP
Authors	Achim Blumensath, Martin Otto, Mark Weyer

Comments (0)