A condition for two words being powers of the same word (Algebraic Systems, Formal Languages and Conventional and Unconventional Computation Theory)
スポンサーリンク
概要
著者
関連論文
- 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)
- Palindromic completion : a new operation (Algebraic Systems and Theoretical Computer Science)