Linear Markov Properties and Undecidability (Algebraic Semigroups, Formal Languages and Computation)

スポンサーリンク

概要

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

著者

• 小林 ゆう治

  東邦大学理学部

• 勝良 昌司

  京都産業大学理学部

関連論文

• The derivational complexity of string-rewriting systems (Algebras, Languages, Algorithms in Algebraic Systems and Computations)
• On Termination of One-Rule String Rewriting Systems(Semigroups, Formal Languages and Computer Systems)
• Remarks on extractable submonoids (代数系アルゴリズムと言語および計算理論--RIMS研究集会報告集)
• Linear Markov Properties and Undecidability (Algebraic Semigroups, Formal Languages and Computation)
• 有限全変換半群の極大帯とその擬順序
• Monoids with finite (regular) complete presentation(Semigroups, Formal Languages and Combinatorics on Words)
• 有限なelementary codeに付随する置換群について-2-
• 有限なelementary codeに付随する置換群について-1-
• Context-free Languages in $X^+ \backslash Q$(Algebraic Theory of Codes and Related Topics)
• 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)
• 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)

もっと見る 閉じる

スポンサーリンク