Rational series with high image complexity

Tietueen suppeat tiedot
dc.contributor.authorJuha Honkala
dc.contributor.organizationfi=matematiikka|en=Mathematics|
dc.contributor.organization-code1.2.246.10.2458963.20.41687507875
dc.converis.publication-id26958894
dc.converis.urlhttps://research.utu.fi/converis/portal/Publication/26958894
dc.date.accessioned2025-08-27T23:26:22Z
dc.date.available2025-08-27T23:26:22Z
dc.description.abstractBy using the universal Diophantine representation of recursively enumerable sets of positive integers due to Matiyasevich we construct a Z-rational series gamma 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(-1)gamma where w. X-*. As a consequence we obtain various undecidability results for Z-rational series.
dc.format.pagerange6
dc.identifier.eissn1290-385X
dc.identifier.jour-issn0988-3754
dc.identifier.olddbid203967
dc.identifier.oldhandle10024/186994
dc.identifier.urihttps://www.utupub.fi/handle/11111/51730
dc.identifier.urnURN:NBN:fi-fe2021042717274
dc.language.isoen
dc.okm.affiliatedauthorHonkala, Juha
dc.okm.discipline113 Computer and information sciencesen_GB
dc.okm.internationalcopublicationnot an international co-publication
dc.okm.internationalityInternational publication
dc.okm.typeA1 ScientificArticle
dc.publisherEDP SCIENCES S A
dc.publisher.countryFranceen_GB
dc.publisher.countryRanskafi_FI
dc.publisher.country-codeFR
dc.relation.doi10.1051/ita/2017001
dc.relation.ispartofjournalRAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications
dc.relation.issue1
dc.relation.volume51
dc.source.identifierhttps://www.utupub.fi/handle/10024/186994
dc.titleRational series with high image complexity
dc.year.issued2017

Tiedostot

Näytetään 1 - 1 / 1
Name:
ita160045.pdf
Size:
136.8 KB
Format:
Adobe Portable Document Format
Description:
Publisher's version
Lataa

Kokoelmat

Rinnakkaistallenteet