Separating the Words of a Language by Counting Factors

Tietueen suppeat tiedot
dc.contributor.authorSaarela Aleksi
dc.contributor.organizationfi=matematiikka|en=Mathematics|
dc.contributor.organization-code1.2.246.10.2458963.20.41687507875
dc.converis.publication-id66682260
dc.converis.urlhttps://research.utu.fi/converis/portal/Publication/66682260
dc.date.accessioned2022-10-28T14:39:24Z
dc.date.available2022-10-28T14:39:24Z
dc.description.abstractFor a given language L, we study the languages X such that for all distinct words u; v is an element of L, there exists a word x is an element of X that appears a different number of times as a factor in u and in v. In particular, we are interested in the following question: For which languages L does there exist a finite language X satisfying the above condition? We answer this question for all regular languages and for all sets of factors of infinite words.
dc.format.pagerange375
dc.format.pagerange393
dc.identifier.jour-issn0169-2968
dc.identifier.olddbid189514
dc.identifier.oldhandle10024/172608
dc.identifier.urihttps://www.utupub.fi/handle/11111/44648
dc.identifier.urnURN:NBN:fi-fe2021100750359
dc.language.isoen
dc.okm.affiliatedauthorSaarela, Aleksi
dc.okm.discipline111 Mathematicsen_GB
dc.okm.discipline111 Matematiikkafi_FI
dc.okm.internationalcopublicationnot an international co-publication
dc.okm.internationalityInternational publication
dc.okm.typeA1 ScientificArticle
dc.publisherIOS PRESS
dc.publisher.countryNetherlandsen_GB
dc.publisher.countryAlankomaatfi_FI
dc.publisher.country-codeNL
dc.relation.doi10.3233/FI-2021-2047
dc.relation.ispartofjournalFundamenta Informaticae
dc.relation.issue4
dc.relation.volume180
dc.source.identifierhttps://www.utupub.fi/handle/10024/172608
dc.titleSeparating the Words of a Language by Counting Factors
dc.year.issued2021

Tiedostot

Näytetään 1 - 1 / 1
Name:
ssf.pdf
Size:
501.13 KB
Format:
Adobe Portable Document Format
Description:
Final draft
Lataa

Kokoelmat

Rinnakkaistallenteet