Regular expressions and finite automata represent regular languages. The link between these two mathematical structures is the subject of many research topics. Each one of these models gets advantages and inconveniences. In this document, new regular operators are defined, the multitildes- bars, which create a new expression model falling in the range of finite automata to simple regular expressions, which uses concatenation, union, and Kleene's star. Multi-tildes-bars are based on simple regular operations, namely the adjunction or the elimination of the empty word. Several classical conversions between simple regular expressions and finite automata are extended to these new operators. Finally, we show that these new expressions have an exponential factorization power with respect to the one of simple regular expressions. Keywords
