Axiomatizing the equational theory of regular tree languages: Extended abstract

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 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
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages455-465
Number of pages11
Volume1373 LNCS
DOIs
Publication statusPublished - 1998
Event15th Annual Symposium on Theoretical Aspects of Computer Science, STACS 98 - Paris, France
Duration: Feb 25 1998Feb 27 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1373 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other15th Annual Symposium on Theoretical Aspects of Computer Science, STACS 98
CountryFrance
CityParis
Period2/25/982/27/98

Fingerprint

Equational Theory
Axiomatization
Finite Set
Fixed point
Valid
Language
Generalization

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Ésik, Z. (1998). Axiomatizing the equational theory of regular tree languages: Extended abstract. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1373 LNCS, pp. 455-465). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1373 LNCS). https://doi.org/10.1007/BFb0028581

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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1373 LNCS 1998. p. 455-465 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1373 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ésik, Z 1998, Axiomatizing the equational theory of regular tree languages: Extended abstract. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 1373 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1373 LNCS, pp. 455-465, 15th Annual Symposium on Theoretical Aspects of Computer Science, STACS 98, Paris, France, 2/25/98. https://doi.org/10.1007/BFb0028581
Ésik Z. Axiomatizing the equational theory of regular tree languages: Extended abstract. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1373 LNCS. 1998. p. 455-465. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/BFb0028581
Ésik, Z. / Axiomatizing the equational theory of regular tree languages : Extended abstract. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1373 LNCS 1998. pp. 455-465 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{f7439f578af64e169c8bfe76ebd560ec,
title = "Axiomatizing the equational theory of regular tree languages: Extended abstract",
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.",
author = "Z. {\'E}sik",
year = "1998",
doi = "10.1007/BFb0028581",
language = "English",
isbn = "3540642307",
volume = "1373 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "455--465",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Axiomatizing the equational theory of regular tree languages

T2 - Extended abstract

AU - Ésik, Z.

PY - 1998

Y1 - 1998

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.

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

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

U2 - 10.1007/BFb0028581

DO - 10.1007/BFb0028581

M3 - Conference contribution

AN - SCOPUS:33750090130

SN - 3540642307

SN - 9783540642305

VL - 1373 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 455

EP - 465

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -