Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Laurent Waxweiler"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 31, Iss Proc. DCFS 2010, Pp 48-57 (2010)
Under some mild assumptions, we study the state complexity of the trim minimal automaton accepting the greedy representations of the multiples of m >= 2 for a wide class of linear numeration systems. As an example, the number of states of the trim mi
Externí odkaz:
https://doaj.org/article/35971ca60e5e454482f95f746e1453b8
Publikováno v:
Communications in Algebra. 44:2075-2099
Adapting a result of R. Villemaire on expansions of Presburger arithmetic, we show how to define multiplication in some expansions of the additive reduct of certain Euclidean rings. In particular, this applies to polynomial rings over a finite field.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4efc35562e0a4b8e5e86b0e46480cea2
https://doi.org/10.1080/00927872.2015.1028236
https://doi.org/10.1080/00927872.2015.1028236
Autor:
Laurent Waxweiler, Michel Rigo
Publikováno v:
International Journal of Foundations of Computer Science. 22:1549-1563
The ring of integers and the ring of polynomials over a finite field share a lot of properties. Using a bounded number of polynomial coefficients, any polynomial can be decomposed as a linear combination of powers of a non-constant polynomial P playi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::845bb36ccdc572abc7f3eed43024ea13
https://doi.org/10.1142/s0129054111008878
https://doi.org/10.1142/s0129054111008878
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 31, Iss Proc. DCFS 2010, Pp 48-57 (2010)
Under some mild assumptions, we study the state complexity of the trim minimal automaton accepting the greedy representations of the multiples of m >= 2 for a wide class of linear numeration systems. As an example, the number of states of the trim mi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aab51a3915238a8b7c5f42035ffbcb96
http://arxiv.org/abs/1008.1668
http://arxiv.org/abs/1008.1668
