検索結果 2 件
デジタル記事
インターネットで読める全国の図書館
- 一般注記28th International Symposium on Mathematical Foundations of Computer Science (MFCS 2003) ...
- 関連情報Lecture Notes in Computer Science || 2747 || p189-197 http://www.mfcs.sk/m...
デジタル記事
インターネットで読める全国の図書館
- 要約等We show the tight upperbound of the length of the minimum solution of a word equation L = R in one variable, in terms of the differences between the positions of corresponding variable occurrences in L and R. By introducing the notion of difference, the proof is obtained from Fine and Wilfrsquos theorem. As a coro......t implies that the length of the minimum solution is less than N...... |L|+|R|. 28th International Symposium on Mathematical Foundations of Computer Science (MFCS 2003) ...
- 出版者（掲載誌）Springer
検索結果は以上です。