No label defined (Q3677879)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3899084
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3899084

      Statements

      0 references
      1985
      0 references
      rational series in noncommuting variables
      0 references
      finite prefixial subset
      0 references
      finite complete code
      0 references
      recurrence relation
      0 references
      [For the entire collection see Zbl 0549.00009.] This is a survey paper on rational series in noncommuting variables, which may be used to an introduction to the subject. Some open problems are also presented. I will just mention one of them here, the answer to which is in fact well-known. As said by the author, for any rational series \(S=\sum_{w\in X^*}(S,w)w\) on the alphabet X over the field R, there exist a finite prefixial subset \(\Pi\) of \(X^*\), a finite complete code \(C=\Pi X\setminus \Pi\) and elements \(\alpha_{c,p}\) of R such that for any words w in \(X^*\) and c in \(C: (S,cw)=\sum_{p\in \Pi}\alpha_{c,p}(S,pw)\). The author asks in which case such a recurrence relation guarantees the rationality of S. The answer is that if \(\Pi\) as above is finite, then S is recognizable, hence rational. Indeed, one defines for any letter x a matrix \(\mu x\in R^{\Pi \times \Pi}\) by \((\mu x)_{p,q}=1\) if \(px=q\), \(=0\) if px\(\in \Pi \setminus q\), \(=\alpha_{px,q}\) if px\(\in C\). Moreover \(\lambda \in R^{1\times \Pi}\) and \(\gamma \in R^{1\times \Pi}\) are defined by \(\lambda_ p=\delta_{p,1}\) and \(\gamma_ p=(S,p)\). Then one shows that \((S,w)=\lambda \mu w\gamma\), where \(\mu\) is extended multiplicatively to \(X^*\). This construction, which goes back to \textit{M. P. Schützenberger} [Inf. Control 4, 245-270 (1961; Zbl 0104.007)], shows that S is recognizable.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references