当前位置: X-MOL 学术Int. J. Found. Comput. Sci. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation
International Journal of Foundations of Computer Science ( IF 0.6 ) Pub Date : 2019-09-19 , DOI: 10.1142/s0129054119400306
Jozef Jirásek 1 , Matúš Palmovský 2 , Juraj Šebej 3
Affiliation  

We study Kuratowski algebras generated by prefix-, suffix-, factor-, and subword-free languages under the operations of star and complementation. We examine 12 possible algebras, and for each of them, we decide whether or not it can be generated by a prefix-, suffix-, factor-, or subword-free language. In each case when an algebra can be generated by such a language, we show that this language can be taken to be regular, and we compute upper bounds on the state complexities of all the generated languages. Finally, we find generators that maximize these complexities.

中文翻译:

星号和补码下无前缀、无后缀、无因子和无子词语言生成的 Kuratowski 代数

我们研究了在星号和补码运算下由无前缀、无后缀、无因子和无子词的语言生成的 Kuratowski 代数。我们检查了 12 种可能的代数,对于每一种,我们决定它是否可以由无前缀、无后缀、无因子或无子词的语言生成。在每种可以由这种语言生成代数的情况下,我们证明了这种语言可以被认为是有规律的,并且我们计算了所有生成语言的状态复杂度的上限。最后,我们找到了最大化这些复杂性的生成器。
更新日期:2019-09-19
down
wechat
bug