关于交错塔长度的上下限
On Upper and Lower Bounds on the Length of Alternating Towers
摘要：
两种正则语言之间的塔是一个字符串序列，所有奇数位置上的字符串属于其中一种语言，所有偶数位置上的字符串属于另一种语言，并且每个字符串都可以嵌入到序列中的下一个字符串中。众所周知，如果有任何长度的塔，那么也存在一个无限的塔。我们调查的上界和下界的有限塔之间的两个正则语言的自动机表示的语言的大小的情况下，没有无限塔的长度。这个问题与正则语言与分段可测试语言的分离问题有关。
英文摘要：
A tower between two regular languages is a sequence of strings such that all strings on odd positions belong to one of the languages, all strings on even positions belong to the other language, and each string can be embedded into the next string in the sequence. It is known that if there are towers of any length, then there also exists an infinite tower. We investigate upper and lower bounds on the length of finite towers between two regular languages with respect to the size of the automata representing the languages in the case there is no infinite tower. This problem is relevant to the separation problem of regular languages by piecewise testable languages.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
