| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 436577 | Theoretical Computer Science | 2008 | 16 Pages |
Abstract
In this paper, we consider smooth words over 2-letter alphabets {a,b}, where a,b are integers having same parity, with 0
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
