Length of the Shortest Word in the Intersection of Regular Languages
classification
💻 cs.FL
keywords
intersectionlanguageslengthregularshortestwordboundcomplexities
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.