Issue |
RAIRO-Theor. Inf. Appl.
Volume 38, Number 1, January-March 2004
|
|
---|---|---|
Page(s) | 3 - 17 | |
DOI | https://doi.org/10.1051/ita:2004005 | |
Published online | 15 March 2004 |
Axiomatizing omega and omega-op powers of words
1
Department of Computer Science Stevens Institute of Technology
Hoboken, NJ 07030; bloom@cs.stevens-tech.edu.
2
Institute for Informatics University of Szeged 6720 Szeged, Hungary
Received:
5
January
2003
Accepted:
10
October
2003
In 1978, Courcelle asked for a complete set of axioms and rules for the equational theory of (discrete regular) words equipped with the operations of product, omega power and omega-op power. In this paper we find a simple set of equations and prove they are complete. Moreover, we show that the equational theory is decidable in polynomial time.
Mathematics Subject Classification: 06F99 / 03B25
© EDP Sciences, 2004
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.