On Commutation and Conjugacy of Rational Languages and the Fixed Point Method
Pysyvä osoite
Verkkojulkaisu
DOI
Tiivistelmä
The research on language equations has been active during last decades. Compared to the equations on words the equations on languages are much more difficult to solve. Even very simple equations that are easy to solve for words can be very hard for languages. In this thesis we study two of such equations, namely commutation and conjugacy equations. We study these equations on some limited special cases and compare some of these results to the solutions of corresponding equations on words. For both equations we study the maximal solutions, the centralizer and the conjugator. We present a fixed point method that we can use to search these maximal solutions and analyze the reasons why this method is not successful for all languages. We give also several examples to illustrate the behaviour of this method.
Kuvaus
Siirretty Doriasta
Sarja
TUCS Dissertations|115
Saavutettavuusominaisuudet
Ei tietoa saavutettavuudesta