Semi-commutations (Q1094144): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Combinatorial problems of commutation and rearrangements / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Partial commutations and faithful rational transductions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recognizable subsets of some partially Abelian monoids / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3736919 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Maximal serializability of iterated transactions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3659988 / rank | |||
Normal rank |
Latest revision as of 12:09, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Semi-commutations |
scientific article |
Statements
Semi-commutations (English)
0 references
1987
0 references
A semi-commutation system \(S=<X,P>\) is a semi-Thue system, where X is a finite alphabet and P is a set of production rules of the form xy\(\to yx\) for some x,y\(\in X\), \(x\neq y\). The corresponding semi-commutation is the map which assigns to every set \(R\subseteq X^*\) of words over X the set f(R) of all words over X which can be derived from some member of R by means of the production rules in P. The paper contains two main results: a) If both \(f(R_ 1)\) and \(f(R_ 2)\) are regular then so is \(f(R_ 1R_ 2)\). b) \(f(R^*)\) is regular provided \(R=f(R)\) is regular and for every word \(\omega\) the directed graph \(\Gamma\) (\(\omega)\) is strongly connected, where \(\Gamma\) (\(\omega)\) is defined as follows: vertices are all letters \(x\in X\) occurring in \(\omega\). There is an edge \(x\to y'\) iff \(x\neq y\) and the production rule xy\(\to yx\) does not belong to P.
0 references
regular languages
0 references
semi-commutation system
0 references
semi-Thue system
0 references