Detecting palindromes, patterns, and borders in regular languages
Computational Complexity
2009-04-14 v2 Discrete Mathematics
Formal Languages and Automata Theory
Abstract
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.
Cite
@article{arxiv.0711.3183,
title = {Detecting palindromes, patterns, and borders in regular languages},
author = {Terry Anderson and John Loftus and Narad Rampersad and Nicolae Santean and Jeffrey Shallit},
journal= {arXiv preprint arXiv:0711.3183},
year = {2009}
}
Comments
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