首页> 外文OA文献 >Solvability of Word Equations Modulo Finite Special And Confluent String-Rewriting Systems Is Undecidable In General

【2h】

Solvability of Word Equations Modulo Finite Special And Confluent String-Rewriting Systems Is Undecidable In General

机译：词方程的可解性模有限的特殊和融合的字符串重写系统通常无法确定

页面导航

著录项
相似文献
相关主题

著录项

作者
Friedrich Otto;
展开▼
作者单位

展开▼
年度 1995
总页数
原文格式 PDF
正文语种
中图分类

相似文献

外文文献
中文文献
专利

1. A finitely axiomatizable undecidable equational theory with recursively solvable word problems [J] . Delic D. Transactions of the American Mathematical Society . 2000,第7期

机译：具有递归可解单词问题的有限公理化的不确定方程理论
2. MONOID PRESENTATIONS OF GROUPS BY FINITE SPECIAL STRING-REWRITING SYSTEMS [J] . DUNCAN W. PARKES, V. YU. SHAVRUKOV, RICHARD M. THOMAS RAIRO Theoretical Informatics and Applications . 2004,第3期

机译：有限特殊字符串重写系统的单调表示
3. Undecidable properties of monoids with word problem solvable in linear time. Part II - cross sections and homological and homotopical finiteness conditions [J] . Katsura M., Kobayashi Y., Otto F. Theoretical computer science . 2003,第1a3期

机译：具有单词问题的类半定词的不确定特性可以在线性时间内解决。第二部分-横截面以及同构和同构有限条件
4. The Word Matching Problem Is Undecidable for Finite Special String-Rewriting Systems That Are Confluent [C] . Paliath Narendran, Friedrich Otto International colloquium on automata, languages and programming . 1997

机译：匹配问题对于有限的特殊字符串重写系统来说是不可行的
5. Algorithms for solving linear and polynomial systems of equations over finite fields, with applications to cryptanalysis. [D] . Bard, Gregory V. 2007

机译：用于求解有限域上方程的线性和多项式系统的算法，并应用于密码分析。
6. Nonstandard finite difference method for solving complex-order fractional Burgers’ equations [O] . N.H. Sweilam, S.M. AL-Mekhlafi, D. Baleanu 2020

机译：非标准有限差分方法用于解决复杂阶分数汉堡方程
7. It is undecidable whether a finite special string-rewriting system presents a group [O] . Narendran Paliath, ÓDúnlaing Colm, Otto Friedrich 1991

机译：有限的特殊字符串重写系统是否提供一个组是不确定的
8. Secant/Finite Difference Algorithm for Solving Sparse Nonlinear Systems of Equations. [R] . Li, G. 1986

机译：求解稀疏非线性方程组的正割/差分算法。

Solvability of Word Equations Modulo Finite Special And Confluent String-Rewriting Systems Is Undecidable In General

著录项

相似文献

相关主题

期刊订阅