A bracket representation of the monoid of links (Algebraic Semigroups, Formal Languages and Computation)

スポンサーリンク

概要

• 論文の詳細を見る
• 京都大学の論文

著者

• 小林 ゆう治

  東邦大学理学部

• 稲田 勇

  東邦大学理学研究科

• 稲田 勇

  東邦大学理学部情報科学科

• 片海 直樹

  東邦大学理学部

• 片海 直樹

  東邦大学理学部情報科学科

関連論文

• The derivational complexity of string-rewriting systems (Algebras, Languages, Algorithms in Algebraic Systems and Computations)
• Linear Markov Properties and Undecidability (Algebraic Semigroups, Formal Languages and Computation)
• 基本一般化された逆×半群
• 基本一般化された逆*半群
• On representations of locally inverse $\ast$-semigroups(Semigroups, Formal Languages and Combinatorics on Words)
• Some remarks on representations of fundamental generalized inverse $\ast$-semigroups(Semigroups, Formal Languages and Combinatorics on Words)
• Grobner bases on projective bimodules and the Hochschild cohomology(IV) : (Co)homology (Languages, Computations, and Algorithms in Algebraic Systems)
• Grobner bases on projective bimodules and the Hochschild cohomology : Part III. Syzygies (Algorithmic and Computational Theory in Algebra and Languages)
• Well-ordered monoids : two numerical functions (Algebraic Systems, Formal Languages and Conventional and Unconventional Computation Theory)
• A bracket representation of the monoid of links (Algebraic Semigroups, Formal Languages and Computation)
• Note on Transitive Representations of Generalized Inverse *-Semigroups (Languages, Algebra and Computer Systems)
• The word problem for the braid inverse monoid (Algorithms in Algebraic Systems and Computation Theory)
• A short history of repetition-free words (Algebras, Languages, Algorithms and Computations)
• Homogenized modular algorithms for Grobner bases (Algebraic Systems and Theoretical Computer Science)
• Correction to "Derivational complexity of string-rewriting systems" (Algebraic Systems and Theoretical Computer Science)
• Some questions on the real numbers (Algebra and Computer Science)

もっと見る 閉じる

スポンサーリンク