Solutions principales et rang d'un système d'équations avec constantes dans le monoide libre

DOI10.1016/0012-365X(84)90187-0MaRDI QIDQ797700zbMATH OpenFDO

Authors Jean-Pierre Pecuchet

Publication date 1984

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

ranksystem of equationsprincipal solutions

Mathematics Subject Classification ID

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

Recommendations

• On the solvability of a system of linear equations over the domain of principal ideals
• On the solution of systems of equations with constant rank derivatives
• Une nouvelle majoration pour le nombre de solutions d'un système d'équations polynomiales
• scientific article; zbMATH DE number 3058180
• scientific article; zbMATH DE number 3046864
• Sur les solutions linéairement indépendantes des équations différentielles à coefficients constants

Cites work

• scientific article; zbMATH DE number 3649012 (Why is no real title available?)
• scientific article; zbMATH DE number 3692684 (Why is no real title available?)
• scientific article; zbMATH DE number 3574107 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• scientific article; zbMATH DE number 3802813 (Why is no real title available?)
• scientific article; zbMATH DE number 3350192 (Why is no real title available?)
• scientific article; zbMATH DE number 3367062 (Why is no real title available?)
• scientific article; zbMATH DE number 3407957 (Why is no real title available?)
• scientific article; zbMATH DE number 3424272 (Why is no real title available?)
• Equations in Free Groups
• Equations in free semigroups
• Finding patterns common to a set of strings
• ON THE RANK OF COEFFICIENTLESS EQUATIONS IN FOUR UNKNOWNS IN A FREE SEMIGROUP
• Sur la détermination du rang d'une équation dans le monoide libre
• Sur le théorème du defaut

Cited in

(6)

• Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general
• Makanin's algorithm is not primitive recursive
• On equality up-to constraints over finite trees, context unification, and one-step rewriting
• Solving word equations
• Systèmes entiers d'équations sur un alphabet fini et conjecture d'Ehrenfeucht
• Solving word equations

This page was built for publication: Solutions principales et rang d'un système d'équations avec constantes dans le monoide libre

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