A1 Refereed original research article in a scientific journal

Finite Orbits of Language Operations



Authors: Charlier E, Domaratzki M, Harju T, Shallit J

Editors: Dediu Adrian-Horja, Inenaga Shunsuke, Martin-Vide Carlos

Publication year: 2011

Journal: Lecture Notes in Computer Science

Book title : Language and Automata Theory and Applications

Journal name in source: LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS

Journal acronym: LECT NOTES COMPUT SC

Volume: 6638

First page : 204

Last page: 215

Number of pages: 2

ISBN: 978-3-642-21253-6

ISSN: 0302-9743

Self-archived copy’s web address: https://research.utu.fi/converis/portal/Publication/2874876


Abstract
We 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.


Research Areas

Downloadable publication

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 2024-26-11 at 11:23