Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

ICALP
2009
Springer

favoriteEmaildiscussreport

134views Programming Languages» more ICALP 2009»

Boundedness of Monadic Second-Order Formulae over Finite Words

13 years 8 months ago

Boundedness of Monadic Second-Order Formulae over Finite Words

Download www.mathematik.tu-darmstadt.de

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

Real-time Traffic

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

claim paper

Related Content

» Finite state automata and monadic definability of singular cardinals

» A modal perspective on monadic secondorder alternation hierarchies

» Monadic datalog over finite structures with bounded treewidth

» Model Checking Quantified Computation Tree Logic

» Facial Circuits of Planar Graphs and ContextFree Languages

Post Info
More Details (n/a)

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

Comments (0)