用自动机求导出作用的正则表达式
Using Automata to obtain Regular Expressions for Induced Actions
摘要:
Kan扩展类行动的演示文稿提供了一个自然的框架,表达诱导行动,因此,一系列不同的组合问题。Kan扩展的重写系统已经被定义,并且在可能的情况下,可以使用Knuth-Benidox完成过程的变体来完成它们。正则语言和自动机是表达集合和动作的一种有用的方式,在本文中,我们解释了如何使用Kan扩展的重写系统来构造表达诱导动作的自动机,以及如何通过从自动机获得语言方程来计算范式集。
英文摘要:
Presentations of Kan extensions of category actions provide a natural framework for expressing induced actions, and therefore a range of different combinatorial problems. Rewrite systems for Kan extensions have been defined and a variation on the Knuth-Bendix completion procedure can be used to complete them -- when possible. Regular languages and automata are a useful way of expressing sets and actions, and in this paper we explain how to use rewrite systems for Kan extensions to construct automata expressing the induced action and how sets of normal forms can be calculated by obtaining language equations from the automata.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。