RAIRO-Theor. Inf. Appl.
Volume 51, Number 1, January-March 2017
|Page(s)||1 - 6|
|Published online||27 February 2017|
Rational series with high image complexity
Department of Mathematics and Statistics, University of Turku, 20014 Turku, Finland.
Received: 6 June 2016
Accepted: 2 January 2017
By using the universal Diophantine representation of recursively enumerable sets of positive integers due to Matiyasevich we construct a Z-rational series r over a binary alphabet X which has a maximal image complexity in the sense that all recursively enumerable sets of positive integers are obtained as the sets of positive coefficients of the series w-1r where w ∈ X∗. As a consequence we obtain various undecidability results for Z-rational series.
Mathematics Subject Classification: 68Q45 / 03B25 / 11U05
Key words: Rational series / recursively enumerable set / Diophantine representation / undecidability
© EDP Sciences 2017
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.