Axiomatizing the equational theory of regular tree languages

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

We show that a finite set of equation schemes together with the least fixed point rule gives a complete axiomatization of the valid identities of regular tree languages. This result is a generalization of Kozen's axiomatization of the equational theory of regular word languages.

Original languageEnglish
Pages (from-to)189-213
Number of pages25
JournalJournal of Logic and Algebraic Programming
Volume79
Issue number2
DOIs
Publication statusPublished - Feb 2010

Fingerprint

Equational Theory
Axiomatization
Finite Set
Fixed point
Valid
Language
Generalization

Keywords

  • Axiomatization
  • Complex algebras
  • Regular tree language

ASJC Scopus subject areas

  • Software
  • Computational Theory and Mathematics
  • Theoretical Computer Science
  • Logic

Cite this

Axiomatizing the equational theory of regular tree languages. / Ésik, Z.

In: Journal of Logic and Algebraic Programming, Vol. 79, No. 2, 02.2010, p. 189-213.

Research output: Contribution to journalArticle

@article{c8815dffc6304fdc858eeaf803e4e0aa,
title = "Axiomatizing the equational theory of regular tree languages",
abstract = "We show that a finite set of equation schemes together with the least fixed point rule gives a complete axiomatization of the valid identities of regular tree languages. This result is a generalization of Kozen's axiomatization of the equational theory of regular word languages.",
keywords = "Axiomatization, Complex algebras, Regular tree language",
author = "Z. {\'E}sik",
year = "2010",
month = "2",
doi = "10.1016/j.jlap.2009.10.001",
language = "English",
volume = "79",
pages = "189--213",
journal = "Journal of Logic Programming",
issn = "1567-8326",
publisher = "Elsevier Inc.",
number = "2",

}

TY - JOUR

T1 - Axiomatizing the equational theory of regular tree languages

AU - Ésik, Z.

PY - 2010/2

Y1 - 2010/2

N2 - We show that a finite set of equation schemes together with the least fixed point rule gives a complete axiomatization of the valid identities of regular tree languages. This result is a generalization of Kozen's axiomatization of the equational theory of regular word languages.

AB - We show that a finite set of equation schemes together with the least fixed point rule gives a complete axiomatization of the valid identities of regular tree languages. This result is a generalization of Kozen's axiomatization of the equational theory of regular word languages.

KW - Axiomatization

KW - Complex algebras

KW - Regular tree language

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

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

U2 - 10.1016/j.jlap.2009.10.001

DO - 10.1016/j.jlap.2009.10.001

M3 - Article

VL - 79

SP - 189

EP - 213

JO - Journal of Logic Programming

JF - Journal of Logic Programming

SN - 1567-8326

IS - 2

ER -