Concurrency measure in commutation monoids (Q1824702)
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 4118611
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Concurrency measure in commutation monoids |
scientific article; zbMATH DE number 4118611 |
Statements
Concurrency measure in commutation monoids (English)
0 references
1989
0 references
A commutation system consists of an alphabet A and a symmetric and irreflexive relation R on A. A pair (a,b) from R represents commutation (or concurrency) of the letters a and b. The author defines a degree which measures the concurrency of each word w, and shows that the degree tends with probability 1 to a fixed limit determined by the commutation system when the length of a randomly chosen word increases.
0 references
commutation system
0 references
alphabet
0 references
concurrency
0 references
word
0 references
degree
0 references
0.8851632475852966
0 references
0.7672557830810547
0 references
0.7381188869476318
0 references
