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

DOI10.1007/BF01091544MaRDI QIDQ1256449zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(6)

• On maximal chains of systems of word equations
• On the Solvability Problem for Restricted Classes of Word Equations
• Decidability of the Existential Theory of the Set of Natural Numbers with Order, Divisibility, Power Functions, Power Predicates, and Constants
• On the edge-independence number and edge-covering number for regular graphs
• scientific article; zbMATH DE number 7561688 (Why is no real title available?)
• On the Solution Sets of Entire Systems of Word Equations

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

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