arXiv 0711.31832007-11cs.CCcs.DMcs.FL

检测正则语言中的回文、模式和边框

Detecting palindromes, patterns, and borders in regular languages

Terry Anderson, John Loftus, Narad Rampersad, Nicolae Santean, Jeffrey Shallit

备注：: Full version of a paper submitted to LATA 2008. This is a new version with John Loftus added as a co-author and containing new results on unbordered words

摘要：

给定一个语言L和一个不确定的有限自动机M，我们考虑我们是否可以有效地确定（在M的大小），如果M接受L中的至少一个词，或无限多个词。假设M至少接受L中的一个单词，我们考虑最短的单词可以有多长。我们研究的语言L包括回文、非回文、k次幂、非k次幂、幂、非幂（也称为原始词）、匹配一般模式的词、有界词和无界词。

英文摘要：

Given a language L and a nondeterministic finite automaton M, we consider whether we can determine efficiently (in the size of M) if M accepts at least one word in L, or infinitely many words. Given that M accepts at least one word in L, we consider how long a shortest word can be. The languages L that we examine include the palindromes, the non-palindromes, the k-powers, the non-k-powers, the powers, the non-powers (also called primitive words), the words matching a general pattern, the bordered words, and the unbordered words.

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