Algebraic characterization of the finite power property

Authors:
Michal Kunc
Affiliations:
Department of Mathematics, University of Turku
Venue:
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Year:
2006

Citing 9
Cited 0

Easy multiplications. I. The realm of Kleene's theorem

Information and Computation
Algorithms for determining relative star height and star height

Information and Computation
String-rewriting systems

String-rewriting systems
Handbook of Formal Languages

Handbook of Formal Languages
The finite power problem revisited

Information Processing Letters
Recognizable Sets with Multiplicities in the Tropical Semiring

MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
The finite power property in free groups

Theoretical Computer Science
Regular solutions of language inequalities and well quasi-orders

Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Limited subsets of a free monoid

SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a transparent characterization, by means of a certain syntactic semigroup, of regular languages possessing the finite power property. Then we use this characterization to obtain a short elementary proof for the uniform decidability of the finite power property for rational languages in all monoids defined by a confluent regular system of deletion rules. This result in particular covers the case of free groups solved earlier by d'Alessandro and Sakarovitch by means of an involved reduction to the boundedness problem for distance automata.