首页> 外文期刊>Theoretical computer science >Axiomatizing the subsumption and subword preorders on finite and infinite partial words
【24h】

Axiomatizing the subsumption and subword preorders on finite and infinite partial words

机译:对有限和无限分词上的包含和子词前置进行公理化

获取原文
获取原文并翻译 | 示例
           

摘要

We consider two-sorted algebras of finite and infinite partial words equipped with the sub-sumption preorder and the operations of series and parallel product and omega power. It is shown that the valid equations and inequations of these algebras can be described by an infinite collection of simple axioms, and that no finite axiomatization exists. We also prove similar results for two related preorders, namely for the induced partial subword preorder and the partial subword preorder. Along the way of proving these results, we provide a concrete description of the free algebras in the corresponding varieties in terms of generalized series-parallel partial words.
机译:我们考虑有限子和无限子词的两类代数,这些代数配备了子归类预序以及串联和并行乘积与ω幂的运算。结果表明,这些代数的有效方程和不等式可以由简单公理的无限集合来描述,并且不存在有限公理化。我们还证明了两个相关的前置词的相似结果,即诱导部分子词前置词和部分子词前置词。在证明这些结果的过程中,我们以广义的串并联分词的形式对相应品种中的自由代数进行了具体描述。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号