Regular Expressions and Transducers over Alphabet-Invariant and User-Defined Labels

Abstract

We are interested in regular expressions and transducers that represent word relations in an alphabet-invariant way-for example, the set of all word pairs u,v where v is a prefix of u independently of what the alphabet is. Current software systems of formal language objects do not have a mechanism to define such objects. We define transducers in which transition labels involve what we call set specifications, some of which are alphabet invariant. In fact, we give a more broad definition of automata-type objects, called labelled graphs, where each transition label can be any string, as long as that string represents a subset of a certain monoid. Then, the behaviour of the labelled graph is a subset of that monoid. We do the same for regular expressions. We obtain extensions of a few classic algorithmic constructions on ordinary regular expressions and transducers at the broad level of labelled graphs and in such a way that the computational efficiency of the extended constructions is not sacrificed. For regular expressions with set specs we obtain the corresponding partial derivative automata. For transducers with set specs we obtain further algorithms that can be applied to questions about independent regular languages, in particular the witness version of the independent property satisfaction question.

Prediction Method of User Behavior Label Based on the BP Neural Network

“…e intention of precision marketing is to push out the product information highly relevant to consumers' interests in an easily accessible way instead of waiting for them to nd it among tons of irrelevant advertisements. us, precision marketing means to help consumers be more e cient in making every shopping decisions in their lives [3].…”