Rational strong codes and structure of rational group languages
type: Item
instance of: scholarly article
title: Rational strong codes and structure of rational group languages
zbMATH Open document ID: 0619.20046
DOI: 10.1007/BF02573102
author: Louxin Zhang
published in: Semigroup Forum
publication date: 1987-01-01T00:00:00Z
full work available at URL: https://eudml.org/doc/134868
review text: 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.
Mathematics Subject Classification ID: 20M35
Mathematics Subject Classification ID: 20M05
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 4004488
zbMATH Keywords: presentation
zbMATH Keywords: words
zbMATH Keywords: congruence
zbMATH Keywords: rational strong codes
zbMATH Keywords: rational group languages
MaRDI profile type: Publication
cites work: Q3329652
cites work: Confluent and Other Types of Thue Systems
cites work: Q4198075
cites work: On a special monoid with a single defining relation
cites work: Q3853827
cites work: Q4152137
cites work: Reflective star languages and codes
description: scientific article; zbMATH DE number 4004488