語問題を基底等式集合の語問題に帰着可能な等式集合のクラスについて
Bibliographic Information
- Other Title
-
- ゴ モンダイ オ キテイ トウシキ シュウゴウ ノ ゴ モンダイ ニ キチャク カノウ ナ トウシキ シュウゴウ ノ クラス ニ ツイテ
- On class of equation sets whose word problems are reducible to those of ground equation sets
Search this article
Abstract
The word problem of an equation set is to decide, given two terms, whether the two terms are equivalent under the equations. In this paper, we show that word problems of linear, shallow, non-erasing and non-collapsing equation sets are reducible to those of equation sets having no variables, where we use a transformation that substitutes ground terms determined from the equation set and the given two terms into each equation. This result allows us to use decision algorithms for the word problem of an equation set without variables to solve the target problem.
IEICE Technical Report;MSS2011-62,IEICE Technical Report;SS2011-47
Journal
-
- 電子情報通信学会技術研究報告. SS, ソフトウェアサイエンス
-
電子情報通信学会技術研究報告. SS, ソフトウェアサイエンス 111 (406), 45-49, 2012-01
一般社団法人電子情報通信学会
- Tweet
Details 詳細情報について
-
- CRID
- 1050282813781387008
-
- NII Article ID
- 110009482061
- 10031102346
- 110009480933
-
- NII Book ID
- AA1123312X
-
- HANDLE
- 2237/23552
-
- ISSN
- 09135685
-
- Text Lang
- ja
-
- Article Type
- journal article
-
- Data Source
-
- IRDB
- NDL
- CiNii Articles
- KAKEN