Length of the Shortest Word in the Intersection of Regular Languages
arXiv:0910.1528
Abstract
In this note, we give a construction that provides a tight lower bound of mn-1 for the length of the shortest word in the intersection of two regular languages with state complexities m and n.