An application of the matrix representation of transductions (Q1057659): 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(85)90019-2 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1995176558 / rank | |||
Normal rank |
Revision as of 23:00, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An application of the matrix representation of transductions |
scientific article |
Statements
An application of the matrix representation of transductions (English)
0 references
1985
0 references
The paper deals with the following classical problem of formal language theory: given \(n\) languages \(L_ 1, L_ 2,\dots, L_ n\) recognized by the monoids \(M_ 1, M_ 2,\dots, M_ n\), respectively, and given an operation \(\phi\), find a monoid \(M\) recognizing the language \(\phi (L_ 1,\dots, L_ n)\). The author proves that most of the constructions given in the literature for solving this problem are particular cases of a general method based on considering the operation \(\phi\) as the inverse of a transduction. The procedure is not universal: the complementation and the star operation cannot be processed in this way, but a lot of operations can be approached in this way (union, intersection, inverse substitutions, quotient, concatenation, shuffle and so on, including the control operation on TOL systems).
0 references
matricial representation
0 references
monoid
0 references
transduction
0 references