Semicommutations and algebraic languages (Q1199527): 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: Q3723719 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Semi-commutations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3736919 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Langages infinitaires et produit de mixage / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cônes rationnels commutatifs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4347974 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3698316 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3725561 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On lexicographic semi-commutations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3738586 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3774977 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Notes on finite asynchronous automata / rank | |||
Normal rank |
Latest revision as of 16:18, 16 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Semicommutations and algebraic languages |
scientific article |
Statements
Semicommutations and algebraic languages (English)
0 references
16 January 1993
0 references
Let \(\theta\) be a binary irreflexive relation over an alphabet \(X\) (semi- commutation relation) and let \(P\) be a rewriting system with the rules \(\{ab\to ba\mid\;(a,b)\in\theta\}\). For a language \(L\subseteq X^*\), \(f_ \theta(L)\) denotes the set of all words that can be obtained from elements of \(L\) by means of \(P\). The authors show that it is possible to decide if for a given \(\theta\) the family \(\{f_ \theta(L)\mid\;L\) rational subset of \(X^*\}\) contains only algebraic languages.
0 references
algebraic languages
0 references