Abstract | ||
---|---|---|
A mapping phi : Z --> Z is called piecewise affine if there exist integers a greater than or equal to 1 and u(j) greater than or equal to 1, v(j) for 0 less than or equal to j < a such that phi(an + j) = u(j)n + v(j) whenever n is an element of Z and 0 less than or equal to j < a. We prove that if s = (s(n))(n)greater than or equal too and t = (t(n))(n)greater than or equal to0 are N-rational sequences such that s takes each value exactly as many times as t, then there exists a piecewise affine mapping phi: Z --> Z such that s(n) = t(phi(n)) for almost all n greater than or equal to 0. As an application we solve the HDOL language equivalence problem in some cases. |
Year | DOI | Venue |
---|---|---|
2003 | 10.1142/S0218196703001390 | INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION |
Keywords | DocType | Volume |
N-rational sequences, images of N-rational sequences, HDOL language equivalence problem | Journal | 13 |
Issue | ISSN | Citations |
3 | 0218-1967 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Juha Honkala | 1 | 198 | 52.07 |
Keijo Ruohonen | 2 | 151 | 22.20 |