Rational strong codes and structure of rational group languages (Q1089439): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3329652 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Confluent and Other Types of Thue Systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198075 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a special monoid with a single defining relation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3853827 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4152137 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reflective star languages and codes / rank | |||
Normal rank |
Latest revision as of 19:56, 17 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Rational strong codes and structure of rational group languages |
scientific article |
Statements
Rational strong codes and structure of rational group languages (English)
0 references
1987
0 references
Let \(<A\); \(w_ i=v_ i|\) \(i\in I>\) be a finitely generated presentation, \(\Lambda\) be the identity of \(A^*\). The set [\(\Lambda\) ] of words congruent to \(\Lambda\) with respect to the congruence generated by \(\{(w_ i,v_ i)|\) \(i\in I\}\), is a free submonoid of \(A^*\), whose base is a strong code. We study rational strong codes. Using them, we give the structure of rational group languages.
0 references
presentation
0 references
words
0 references
congruence
0 references
rational strong codes
0 references
rational group languages
0 references