Rational strong codes and structure of rational group languages (Q1089439)
From MaRDI portal
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