Rational strong codes and structure of rational group languages

Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Formal languages and automata (68Q45)

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.

Recommendations

Cites work

Cited in

(12)

This page was built for publication: Rational strong codes and structure of rational group languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1089439)