Solutions of systems consisting of word equations and inequalities in lengths of words

DOI10.1007/BF01091544zbMath0404.03032OpenAlexW2019168214MaRDI QIDQ1256449

K. Appert

Publication date: 1977

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01091544

zbMATH Keywords

recursively enumerable setword equationword length inequality

Mathematics Subject Classification ID

Word problems, etc. in computability and recursion theory (03D40) Recursively (computably) enumerable sets and degrees (03D25)

Related Items (1)

Decidability of the Existential Theory of the Set of Natural Numbers with Order, Divisibility, Power Functions, Power Predicates, and Constants

Cites Work

• Unnamed Item

This page was built for publication: Solutions of systems consisting of word equations and inequalities in lengths of words