论文信息 - Boundedness of Monadic Second-Order Formulae over Finite Words - 字舞流文

Boundedness of Monadic Second-Order Formulae over Finite Words

We prove that the boundedness problem for monadic second-order logic over the class of all finite words is decidable.

Achim Blumensath | Martin Otto | Mark Weyer

[1] Kosaburo Hashiguchi,et al. Improved Limitedness Theorems on Finite Automata with Distance Functions , 1990, Theor. Comput. Sci..

[2] Yiannis N. Moschovakis,et al. Global inductive definability , 1978, Journal of Symbolic Logic.

[3] Martin Otto. Eliminating Recursion in the µ-Calculus , 1999, STACS.

[4] Stephan Kreutzer,et al. Boundedness of Monadic FO over Acyclic Structures , 2007, ICALP.

[5] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.

[6] Hing Leung,et al. The limitedness problem on distance automata: Hashiguchi's method revisited , 2004, Theor. Comput. Sci..

[7] Alex K. Simpson,et al. Computational Adequacy in an Elementary Topos , 1998, CSL.

[8] Martin Otto,et al. The Boundedness Problem for Monadic Universal First-Order Logic , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[9] Harry G. Mairson,et al. Undecidable Boundedness Problems for Datalog Programs , 1995, J. Log. Program..

[10] Haim Gaifman,et al. Decidable optimization problems for database logic programs , 1988, STOC '88.

[11] Christof Löding,et al. The Nesting-Depth of Disjunctive µ-Calculus for Tree Languages and the Limitedness Problem , 2008, CSL.

[12] Jörg Flum,et al. Finite model theory , 1995, Perspectives in Mathematical Logic.

[13] Kosaburo Hashiguchi,et al. Limitedness Theorem on Finite Automata with Distance Functions , 1982, J. Comput. Syst. Sci..