You are here: TUCS > PUBLICATIONS > Publication Search > Fixed Point Approach to Commut...
Fixed Point Approach to Commutation of Languages
Karel Culik II, Juhani Karhumäki, Petri Salmela, Fixed Point Approach to Commutation of Languages. TUCS Technical Reports 582, Turku Centre for Computer Science, 2003.
Abstract:
We show that the maximal set commuting with a given regular set
-- its centralizer -- can be defined as the maximal fixed point of
a certain language operator. However, an infinite
number of iterations might be needed even in the case of finite
languages.
Files:
Full publication in PDF-format
BibTeX entry:
@TECHREPORT{tCuKaSa03a,
title = {Fixed Point Approach to Commutation of Languages},
author = {Culik II, Karel and Karhumäki, Juhani and Salmela, Petri},
number = {582},
series = {TUCS Technical Reports},
publisher = {Turku Centre for Computer Science},
year = {2003},
keywords = {commutation, fixed point},
ISBN = {952-12-1286-1},
}
Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics