首页> 外文会议>Conference on Computability in Europe >Hard Problems for Simple Word Equations: Understanding the Structure of Solution Sets in Restricted Cases
【24h】

Hard Problems for Simple Word Equations: Understanding the Structure of Solution Sets in Restricted Cases

机译:简单单词方程式的难题:了解受限情况下解集的结构

获取原文

摘要

A word equation is a tuple (α, β), usually written α = β, such that α and β are words over a combined alphabet X∪∑ consisting of variables X = {x, y, z, … } and terminal symbols ∑ = {a, b,...}. A solution to a word equation is a substitution of the variables for words in ∑* unifying the two terms α and β. In other words, a solution is a (homo)morphism h:(X∪∑)*→∑* satisfying h(a) = a for all a∈∑ such that h(α) = h(β). For example, one solution h to the word equation xaby = ybax is given by h(ⅹ) = b and h(y) = bab.
机译:单词方程式是一个元组(α,β),通常写成α=β,这样α和β是组合字母X∪∑上的单词,该组合由变量X = {x,y,z,…}和终端符号∑组成= {a,b,...}。单词方程式的一种解决方案是用∑ *中的单词替换变量,以统一两个项α和β。换句话说,一个解是对于所有a∈∑满足h(a)= a的(同)同态h:(X∪∑)*→∑ *,使得h(α)= h(β)。例如,单词方程xaby = ybax的一种解h由h(ⅹ)= b和h(y)= bab给出。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号