80
Voted
DAGSTUHL
2006
15 years 9 days ago
2006
We examine finite words over an alphabet = {a,
81
Voted
ICALP
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. We prove that the boundedness problem for monadic secondorder logic over the class of all finite words is decidable.