Axiomatizing omega and omega-op powers of words

Stephen L. Bloom, Z. Ésik

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)3-17
Number of pages15
JournalTheoretical Informatics and Applications
Volume38
Issue number1
DOIs
Publication statusPublished - Jan 2004

Fingerprint

Equational Theory
Polynomials
Axioms
Polynomial time

ASJC Scopus subject areas

  • Information Systems

Cite this

Axiomatizing omega and omega-op powers of words. / Bloom, Stephen L.; Ésik, Z.

In: Theoretical Informatics and Applications, Vol. 38, No. 1, 01.2004, p. 3-17.

Research output: Contribution to journalArticle

@article{0ef3db2101cb47f19b355e6415c43bbb,
title = "Axiomatizing omega and omega-op powers of words",
abstract = "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.",
author = "Bloom, {Stephen L.} and Z. {\'E}sik",
year = "2004",
month = "1",
doi = "10.1051/ita:2004005",
language = "English",
volume = "38",
pages = "3--17",
journal = "RAIRO - Theoretical Informatics and Applications",
issn = "0988-3754",
publisher = "EDP Sciences",
number = "1",

}

TY - JOUR

T1 - Axiomatizing omega and omega-op powers of words

AU - Bloom, Stephen L.

AU - Ésik, Z.

PY - 2004/1

Y1 - 2004/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=12144286049&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=12144286049&partnerID=8YFLogxK

U2 - 10.1051/ita:2004005

DO - 10.1051/ita:2004005

M3 - Article

AN - SCOPUS:12144286049

VL - 38

SP - 3

EP - 17

JO - RAIRO - Theoretical Informatics and Applications

JF - RAIRO - Theoretical Informatics and Applications

SN - 0988-3754

IS - 1

ER -