Finite Orbits of Language Operations

Tietueen suppeat tiedot
dc.contributor.authorCharlier E
dc.contributor.authorDomaratzki M
dc.contributor.authorHarju T
dc.contributor.authorShallit J
dc.contributor.organizationfi=matematiikka|en=Mathematics|
dc.contributor.organization-code1.2.246.10.2458963.20.41687507875
dc.converis.publication-id2874876
dc.converis.urlhttps://research.utu.fi/converis/portal/Publication/2874876
dc.date.accessioned2025-08-28T02:35:03Z
dc.date.available2025-08-28T02:35:03Z
dc.description.abstractWe consider a set of natural operations on languages, and prove that the orbit of any language L under the monoid generated by this set is finite and bounded, independently of L. This generalizes previous results about complement, Kleene closure, and positive closure.
dc.format.pagerange204
dc.format.pagerange215
dc.identifier.jour-issn0302-9743
dc.identifier.olddbid209347
dc.identifier.oldhandle10024/192374
dc.identifier.urihttps://www.utupub.fi/handle/11111/44320
dc.identifier.urnURN:NBN:fi-fe2021042714869
dc.language.isoen
dc.okm.affiliatedauthorHarju, Tero
dc.okm.discipline111 Mathematicsen_GB
dc.okm.discipline111 Matematiikkafi_FI
dc.okm.internationalcopublicationinternational co-publication
dc.okm.internationalityInternational publication
dc.okm.typeA1 ScientificArticle
dc.publisher.countryGermanyen_GB
dc.publisher.countrySaksafi_FI
dc.publisher.country-codeDE
dc.relation.ispartofjournalLecture Notes in Computer Science
dc.relation.volume6638
dc.source.identifierhttps://www.utupub.fi/handle/10024/192374
dc.titleFinite Orbits of Language Operations
dc.year.issued2011

Tiedostot

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

Kokoelmat

Rinnakkaistallenteet