Multi-tildes are regular operators that were introduced to enhance the factorization power of regular expressions, allowing us to add the empty word in several factors of a catenation product of languages. In addition to multi-bars, which dually remove the empty word, they allow representing any acyclic automaton by a linear-sized expression, whereas the lower bound is exponential in the classic case. In this paper, we extend multi-tildes from disjunctive combinations to any Boolean combination, allowing us to exponentially enhance the factorization power of tildes expressions. Moreover, we show how to convert these expressions into finite automata and give a Haskell implementation of them using advanced techniques of functional programming.

中文翻译：

---

受约束的多重波形符：导出的术语和位置自动机

多重波浪号是常规运算符，引入它是为了增强正则表达式的因式分解能力，使我们能够在语言的串联乘积的多个因式中添加空词。除了双重删除空字的多条之外，它们还允许通过线性大小的表达式表示任何非循环自动机，而在经典情况下下限是指数的。在本文中，我们将多波浪号从析取组合扩展到任何布尔组合，使我们能够以指数方式增强波浪号表达式的因式分解能力。此外，我们还展示了如何将这些表达式转换为有限自动机，并使用先进的函数式编程技术给出它们的 Haskell 实现。