关于弱识别态射的运算
Operations on Weakly Recognizing Morphisms
摘要:
从自由半群到有限半群的弱识别态射是定义omega-正则语言类的经典方法,即,一组无限的词是弱可识别的,当且仅当它是接受了一些Büchi自动机。我们考虑弱识别态射的各种构造的几何复杂性。这包括从Büchi自动机到Büchi自动机的转换,到强识别态射的转换和互补。对于某些问题,在二元字母表或简单半群的情况下,我们能够给出更精确的界。
英文摘要:
Weakly recognizing morphisms from free semigroups onto finite semigroups are a classical way for defining the class of omega-regular languages, i.e., a set of infinite words is weakly recognizable by such a morphism if and only if it is accepted by some Büchi automaton. We consider the descriptional complexity of various constructions for weakly recognizing morphisms. This includes the conversion from and to Büchi automata, the conversion into strongly recognizing morphisms, and complementation. For some problems, we are able to give more precise bounds in the case of binary alphabets or simple semigroups.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。