Palindromic completion : a new operation (Algebraic Systems and Theoretical Computer Science)

スポンサーリンク

概要

• 論文の詳細を見る

著者

• 辻 佳代子

  天理大学総合教育センター

• Fazekas Szilard

  京都産業大学理学部

• Mercas Robert

  Otto-von-guericke-universitat Magdeburg Fakultat Fur Informatik

関連論文

• A condition for two words being powers of the same word (Algebraic Systems, Formal Languages and Conventional and Unconventional Computation Theory)
• An Automaton for Deciding Whether a Given Set of Words is a Code. (Algebraic Semigroups, Formal Languages and Computation)
• On Termination of One-Rule String Rewriting Systems(Semigroups, Formal Languages and Computer Systems)
• On inequalities between subword histories (Algebras, Languages, Algorithms and Computations)
• Palindromic completion : a new operation (Algebraic Systems and Theoretical Computer Science)

スポンサーリンク