论文标题
常规单语言
Regular Monoidal Languages
论文作者
论文摘要
我们及其相关的语法和自动机介绍了普通语言的形态学语言。这些包含单词和树的普通语言的经典理论，但也可以在字符串图上打开更广泛的语言。我们使用单型和笛卡尔限制类别的代数来研究常规单语言的特性，并通过确定性单体自动机为其可识别性提供足够的条件。
We introduce regular languages of morphisms in free monoidal categories, with their associated grammars and automata. These subsume the classical theory of regular languages of words and trees, but also open up a much wider class of languages over string diagrams. We use the algebra of monoidal and cartesian restriction categories to investigate the properties of regular monoidal languages, and provide sufficient conditions for their recognizability by deterministic monoidal automata.
