Vertaisarvioitu artikkeli konferenssijulkaisussa (A4)

Separating many words by counting occurrences of factors




Julkaisun tekijät: Saarela A.

Konferenssin vakiintunut nimi: International Conference on Developments in Language Theory

Kustantaja: Springer Verlag

Julkaisuvuosi: 2019

Journal: Lecture Notes in Computer Science

Kirjan nimi *: Developments in Language Theory: 23rd International Conference, DLT 2019, Warsaw, Poland, August 5–9, 2019, Proceedings

Tietokannassa oleva lehden nimi: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Sarjan nimi: Theoretical Computer Science and General Issues

Volyymi: 11647

ISBN: 978-3-030-24885-7

eISBN: 978-3-030-24886-4

DOI: http://dx.doi.org/10.1007/978-3-030-24886-4_19

Rinnakkaistallenteen osoite: https://research.utu.fi/converis/portal/detail/Publication/44130548


Tiivistelmä

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.


Ladattava julkaisu

This is an electronic reprint of the original article.
This reprint may differ from the original in pagination and typographic detail. Please cite the original version.




Last updated on 2022-07-04 at 17:35