arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1204.4443cs.FL
收藏

一阶量词与图画语言高度片段的句法幺半群

First-Order Quantifiers and the Syntactic Monoid of Height Fragments of Picture Languages

Oliver Matz

摘要:

我们调查的表达能力的一阶量化的一元二阶逻辑的背景下,图片。我们表明,k+1集量词交替允许定义一个图片语言,不能使用任意多个一阶量词交替之前的k集量词交替定义。该方法使用,对于一个给定的图片语言L和一个整数m > 0的高度-m片段的L,这是定义为词的语言,通过考虑每个图片p的高度m的L作为一个词,其中该词的字母是列的p。一个关键的想法是衡量一个规则的词语言的复杂性,其语法幺半群的组复杂性。给定图片语言L,这样的词语言度量可以应用于其高度片段中的每一个,使得图片语言的复杂度是将每个m映射到L的高度-m片段的复杂度的函数。该函数的渐近增长率可以基于定义L的一元二阶公式的结构而有界。该下界证明的核心论点是基于Straubing通过Rhodes和Tilson的块积对一阶量词对单词语言的句法幺半群的影响的代数表征。

英文摘要:

We investigate the expressive power of first-order quantifications in the context of monadic second-order logic over pictures. We show that k+1 set quantifier alternations allow to define a picture language that cannot be defined using k set quantifier alternations preceded by arbitrarily many first-order quantifier alternations. The approach uses, for a given picture language L and an integer m > 0 the height-m fragment of L, which is defined as the word language obtained by considering each picture p of height m in L as a word, where the letters of that word are the columns of p. A key idea is to measure the complexity of a regular word language by the group complexity of its syntactic monoid. Given a picture language L, such a word language measure may be applied to each of its height fragments, so that the complexity of the picture language is a function that maps each m to the complexity of the height-m fragment of L. The asymptotic growth rate of that function may be bounded based on the structure of a monadic second-order formula that defines L. The core argument for that lower bound proof is based on Straubing's algebraic characterization of the effect of first-order quantifiers on the syntactic monoid of word languages by means of Rhodes' and Tilson's block product.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑