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

原子的复杂性,组合

Complexity of Atoms, Combinatorially

Szabolcs Ivan

摘要:

$L$的原子是由Brzozowski和Tamm在2011年引入的,作为$L$的有补和无补子的交集。他们在2013年推导出了原子复杂性的严格上限。2014年,Brzozowski和Davies描述了满足这些边界的正则语言。为了实现这些结果,他们使用了由Brzozowski和Tamm在2011年引入的所谓的“原子”语言。在这份说明中,我们给出了另一种证明他们的特征,通过一个纯粹的组合方法。

英文摘要:

Atoms of a (regular) language $L$ were introduced by Brzozowski and Tamm in 2011 as intersections of complemented and uncomplemented quotients of $L$. They derived tight upper bounds on the complexity of atoms in 2013. In 2014, Brzozowski and Davies characterized the regular languages meeting these bounds. To achieve these results, they used the so-called "atomaton" of a language, introduced by Brzozowski and Tamm in 2011. In this note we give an alternative proof of their characterization, via a purely combinatorial approach.

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

↑