Sciweavers

Share
ICALP
2009
Springer

Boundedness of Monadic Second-Order Formulae over Finite Words

10 years 3 months ago
Boundedness of Monadic Second-Order Formulae over Finite Words
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
Added 16 Aug 2010
Updated 16 Aug 2010
Type Conference
Year 2009
Where ICALP
Authors Achim Blumensath, Martin Otto, Mark Weyer
Comments (0)
books