arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1906.00715cs.FLcs.LOcs.PLcs.SE
收藏

模式的可避免性建模为CSP

On Modelling the Avoidability of Patterns as CSP

Thorsten Ehlers, Florin Manea, Dirk Nowotka, Kamellia Reshadi

摘要:

解决字符串组合学领域的可避免性问题通常需要在初始步骤中通过计算机程序构造一个非常长的单词,该单词不包含任何与给定模式匹配的单词。众所周知,这是一个计算困难的任务。尽管相当简单,最终,所有这些任务都可以形式化为约束满足问题,但到目前为止还没有提出统一的方法来解决它们,并且使用了非常不同的特设方法。我们致力于填补这一空白:我们展示了如何几个相关的可避免性问题可以建模,从而解决,在一个统一的方式作为约束满足问题,使用的框架MiniZinc。这种方法的主要优点是,现在只需要用MiniZinc语言来表达可避免性问题,然后实际搜索解决方案不必特别实施,而是由标准CSP求解器执行。

英文摘要:

Solving avoidability problems in the area of string combinatorics often requires, in an initial step, the construction, via a computer program, of a very long word that does not contain any word that matches a given pattern. It is well known that this is a computationally hard task. Despite being rather straightforward that, ultimately, all such tasks can be formalized as constraints satisfaction problems, no unified approach to solving them was proposed so far, and very diverse ad-hoc methods were used. We aim to fill this gap: we show how several relevant avoidability problems can be modelled, and consequently solved, in an uniform way as constraint satisfaction problems, using the framework of MiniZinc. The main advantage of this approach is that one is now required only to formulate the avoidability problem in the MiniZinc language, and then the actual search for a solution does not have to be implemented ad-hoc, being instead carried out by a standard CSP-solver.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑