Separating many words by counting occurrences of factors

Tietueen suppeat tiedot
dc.contributor.authorSaarela A.
dc.contributor.organizationfi=matematiikka|en=Mathematics|
dc.contributor.organization-code1.2.246.10.2458963.20.41687507875
dc.converis.publication-id44130548
dc.converis.urlhttps://research.utu.fi/converis/portal/Publication/44130548
dc.date.accessioned2022-10-28T13:58:36Z
dc.date.available2022-10-28T13:58:36Z
dc.description.abstract<p>For a given language L, we study the languages X such that for all distinct words   u,v∈L , there exists a word   x∈X  appearing 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.<br /></p>
dc.format.pagerange251
dc.format.pagerange264
dc.identifier.eisbn978-3-030-24886-4
dc.identifier.isbn978-3-030-24885-7
dc.identifier.jour-issn0302-9743
dc.identifier.olddbid185544
dc.identifier.oldhandle10024/168638
dc.identifier.urihttps://www.utupub.fi/handle/11111/42337
dc.identifier.urnURN:NBN:fi-fe2021042824539
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.typeA4 Conference Article
dc.relation.conferenceInternational Conference on Developments in Language Theory
dc.relation.doi10.1007/978-3-030-24886-4_19
dc.relation.ispartofjournalLecture Notes in Computer Science
dc.relation.ispartofseriesTheoretical Computer Science and General Issues
dc.relation.volume11647
dc.source.identifierhttps://www.utupub.fi/handle/10024/168638
dc.titleSeparating many words by counting occurrences of factors
dc.title.bookDevelopments in Language Theory: 23rd International Conference, DLT 2019, Warsaw, Poland, August 5–9, 2019, Proceedings
dc.year.issued2019

Tiedostot

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

Kokoelmat

Rinnakkaistallenteet