Too much duplicating patterns represent nonregular languages

Abstract

A constrained term pattern s:phi represents the language of all instances of the term s satisfying the constraint phi. For each variable in s, this constraint specifies the language of its allowed substitutions.

The goal of this project is to find efficient and computable properties ensuring non-regularity of the language represented by a set of constrained patterns.. A constrained term pattern s:phi represents the language of all instances of the term s satisfying the constraint phi. For each variable in s, this constraint specifies the language of its allowed substitutions.The goal of this project is to find efficient and computable properties ensuring non-regularity of the language represented by a set of constrained patterns.