Sciweavers

DAGSTUHL
2006
14 years 10 months ago
Subwords in reverse-complement order
We examine finite words over an alphabet = {a,
Péter L. Erdös, Péter Ligeti, P...
71
Voted
ICALP
2009
Springer
15 years 22 days 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