左右商相关格的对偶性
Duality of Lattices Associated to Left and Right Quotients
AI总结：
本文研究正则语言左右商的并集与交集所构成的格，证明其左商与右商格对偶，并给出格达到最大复杂度的充要条件。
摘要：
我们将格与正则语言的左商和右商的并集与交集集合相关联。对于并集和交集，我们证明了使用左商和右商生成的格彼此对偶。我们还给出了这些格具有最大可能复杂度的充要条件。
英文摘要：
We associate lattices to the sets of unions and intersections of left and right quotients of a regular language. For both unions and intersections, we show that the lattices we produce using left and right quotients are dual to each other. We also give necessary and sufficient conditions for these lattices to have maximal possible complexity.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
