On regular trace languages (Q1097040): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(87)90080-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2092700841 / rank | |||
Normal rank | |||
Revision as of 00:32, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On regular trace languages |
scientific article |
Statements
On regular trace languages (English)
0 references
1987
0 references
Let A be a finite alphabet and let r be a symmetrical relation on A. Let us consider the free partially commutative monoid M(A,r) generated by A with respect to r (i.e., the quotient of A * by the congruence relation generated by (ab,ba) for all (a,b) in r). It is proved that the free partially commutative monoids M(A,r) whose regular sets form a Boolean algebra or are all unambiguous are the free products of free commutative monoids.
0 references
generalized automata on free products of monoids
0 references
trace language
0 references
commutative monoid
0 references
