首页    期刊浏览 2024年11月30日 星期六
登录注册

文章基本信息

  • 标题:Efficient Algorithms for Morphisms over Omega-Regular Languages
  • 本地全文:下载
  • 作者:Lukas Fleischer ; Manfred Kufleitner
  • 期刊名称:LIPIcs : Leibniz International Proceedings in Informatics
  • 电子版ISSN:1868-8969
  • 出版年度:2015
  • 卷号:45
  • 页码:112-124
  • DOI:10.4230/LIPIcs.FSTTCS.2015.112
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要:Morphisms to finite semigroups can be used for recognizing omega-regular languages. The so-called strongly recognizing morphisms can be seen as a deterministic computation model which provides minimal objects (known as the syntactic morphism) and a trivial complementation procedure. We give a quadratic-time algorithm for computing the syntactic morphism from any given strongly recognizing morphism, thereby showing that minimization is easy as well. In addition, we give algorithms for efficiently solving various decision problems for weakly recognizing morphisms. Weakly recognizing morphism are often smaller than their strongly recognizing counterparts. Finally, we describe the language operations needed for converting formulas in monadic second-order logic (MSO) into strongly recognizing morphisms, and we give some experimental results.
  • 关键词:B{\"u
国家哲学社会科学文献中心版权所有