Aperiodicity in tree automata

Z. Ésik, Szabolcs Iván

Research output: Conference contribution

2 Citations (Scopus)

Abstract

We define and compare several different notions of aperiodicity in tree automata. We also relate these notions to the cascade product and logical definability of tree languages.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages189-207
Number of pages19
Volume4728 LNCS
Publication statusPublished - 2007
Event2nd International Conference on Algebraic Informatics, CAI 2007 - Thessaloniki, Greece
Duration: máj. 21 2007máj. 25 2007

Publication series

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

Other

Other2nd International Conference on Algebraic Informatics, CAI 2007
CountryGreece
CityThessaloniki
Period5/21/075/25/07

Fingerprint

Tree Automata
Definability
Cascade
Language

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Ésik, Z., & Iván, S. (2007). Aperiodicity in tree automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4728 LNCS, pp. 189-207). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4728 LNCS).

Aperiodicity in tree automata. / Ésik, Z.; Iván, Szabolcs.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4728 LNCS 2007. p. 189-207 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4728 LNCS).

Research output: Conference contribution

Ésik, Z & Iván, S 2007, Aperiodicity in tree automata. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4728 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4728 LNCS, pp. 189-207, 2nd International Conference on Algebraic Informatics, CAI 2007, Thessaloniki, Greece, 5/21/07.
Ésik Z, Iván S. Aperiodicity in tree automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4728 LNCS. 2007. p. 189-207. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Ésik, Z. ; Iván, Szabolcs. / Aperiodicity in tree automata. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4728 LNCS 2007. pp. 189-207 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{7886901cd0ad42b092f77003aae5bedd,
title = "Aperiodicity in tree automata",
abstract = "We define and compare several different notions of aperiodicity in tree automata. We also relate these notions to the cascade product and logical definability of tree languages.",
author = "Z. {\'E}sik and Szabolcs Iv{\'a}n",
year = "2007",
language = "English",
isbn = "354075413X",
volume = "4728 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "189--207",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Aperiodicity in tree automata

AU - Ésik, Z.

AU - Iván, Szabolcs

PY - 2007

Y1 - 2007

N2 - We define and compare several different notions of aperiodicity in tree automata. We also relate these notions to the cascade product and logical definability of tree languages.

AB - We define and compare several different notions of aperiodicity in tree automata. We also relate these notions to the cascade product and logical definability of tree languages.

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

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

M3 - Conference contribution

AN - SCOPUS:38749121795

SN - 354075413X

SN - 9783540754138

VL - 4728 LNCS

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

SP - 189

EP - 207

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

ER -