Simulations of weighted tree automata

Z. Ésik, Andreas Maletti

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

5 Citations (Scopus)

Abstract

Simulations of weighted tree automata (wta) are considered. It is shown how such simulations can be decomposed into simpler functional and dual functional simulations also called forward and backward simulations. In addition, it is shown in several cases (fields, commutative rings, Noetherian semirings, semiring of natural numbers) that all equivalent wta M and N can be joined by a finite chain of simulations. More precisely, in all mentioned cases there is a single wta that simulates both M and N. Those results immediately yield decidability of equivalence provided that the semiring is finitely (and effectively) presented.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages321-330
Number of pages10
Volume6482 LNCS
DOIs
Publication statusPublished - 2011
Event15th International Conference on Implementation and Application of Automata, CIAA 2010 - Winnipeg, MB, Canada
Duration: Aug 12 2010Aug 15 2010

Publication series

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

Other

Other15th International Conference on Implementation and Application of Automata, CIAA 2010
CountryCanada
CityWinnipeg, MB
Period8/12/108/15/10

Fingerprint

Weighted Automata
Computability and decidability
Tree Automata
Semiring
Simulation
Noetherian
Decidability
Natural number
Commutative Ring
Immediately
Equivalence

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Ésik, Z., & Maletti, A. (2011). Simulations of weighted tree automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6482 LNCS, pp. 321-330). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6482 LNCS). https://doi.org/10.1007/978-3-642-18098-9_34

Simulations of weighted tree automata. / Ésik, Z.; Maletti, Andreas.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6482 LNCS 2011. p. 321-330 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6482 LNCS).

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

Ésik, Z & Maletti, A 2011, Simulations of weighted tree automata. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 6482 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6482 LNCS, pp. 321-330, 15th International Conference on Implementation and Application of Automata, CIAA 2010, Winnipeg, MB, Canada, 8/12/10. https://doi.org/10.1007/978-3-642-18098-9_34
Ésik Z, Maletti A. Simulations of weighted tree automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6482 LNCS. 2011. p. 321-330. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-18098-9_34
Ésik, Z. ; Maletti, Andreas. / Simulations of weighted tree automata. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6482 LNCS 2011. pp. 321-330 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{911538042623440094994f891548519c,
title = "Simulations of weighted tree automata",
abstract = "Simulations of weighted tree automata (wta) are considered. It is shown how such simulations can be decomposed into simpler functional and dual functional simulations also called forward and backward simulations. In addition, it is shown in several cases (fields, commutative rings, Noetherian semirings, semiring of natural numbers) that all equivalent wta M and N can be joined by a finite chain of simulations. More precisely, in all mentioned cases there is a single wta that simulates both M and N. Those results immediately yield decidability of equivalence provided that the semiring is finitely (and effectively) presented.",
author = "Z. {\'E}sik and Andreas Maletti",
year = "2011",
doi = "10.1007/978-3-642-18098-9_34",
language = "English",
isbn = "9783642180972",
volume = "6482 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "321--330",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Simulations of weighted tree automata

AU - Ésik, Z.

AU - Maletti, Andreas

PY - 2011

Y1 - 2011

N2 - Simulations of weighted tree automata (wta) are considered. It is shown how such simulations can be decomposed into simpler functional and dual functional simulations also called forward and backward simulations. In addition, it is shown in several cases (fields, commutative rings, Noetherian semirings, semiring of natural numbers) that all equivalent wta M and N can be joined by a finite chain of simulations. More precisely, in all mentioned cases there is a single wta that simulates both M and N. Those results immediately yield decidability of equivalence provided that the semiring is finitely (and effectively) presented.

AB - Simulations of weighted tree automata (wta) are considered. It is shown how such simulations can be decomposed into simpler functional and dual functional simulations also called forward and backward simulations. In addition, it is shown in several cases (fields, commutative rings, Noetherian semirings, semiring of natural numbers) that all equivalent wta M and N can be joined by a finite chain of simulations. More precisely, in all mentioned cases there is a single wta that simulates both M and N. Those results immediately yield decidability of equivalence provided that the semiring is finitely (and effectively) presented.

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

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

U2 - 10.1007/978-3-642-18098-9_34

DO - 10.1007/978-3-642-18098-9_34

M3 - Conference contribution

SN - 9783642180972

VL - 6482 LNCS

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

SP - 321

EP - 330

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

ER -