The category of simulations for weighted tree automata

Z. Ésik, Andreas Maletti

Research output: Contribution to journalArticle

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
Pages (from-to)1845-1859
Number of pages15
JournalInternational Journal of Foundations of Computer Science
Volume22
Issue number8
DOIs
Publication statusPublished - Dec 2011

Fingerprint

Computability and decidability

Keywords

  • bisimulation
  • equivalence
  • semiring
  • simulation
  • Weighted tree automaton

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

The category of simulations for weighted tree automata. / Ésik, Z.; Maletti, Andreas.

In: International Journal of Foundations of Computer Science, Vol. 22, No. 8, 12.2011, p. 1845-1859.

Research output: Contribution to journalArticle

@article{e7384b71d22a47cfa56a2ccf8733bf0c,
title = "The category of simulations for 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.",
keywords = "bisimulation, equivalence, semiring, simulation, Weighted tree automaton",
author = "Z. {\'E}sik and Andreas Maletti",
year = "2011",
month = "12",
doi = "10.1142/S0129054111009070",
language = "English",
volume = "22",
pages = "1845--1859",
journal = "International Journal of Foundations of Computer Science",
issn = "0129-0541",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "8",

}

TY - JOUR

T1 - The category of simulations for weighted tree automata

AU - Ésik, Z.

AU - Maletti, Andreas

PY - 2011/12

Y1 - 2011/12

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.

KW - bisimulation

KW - equivalence

KW - semiring

KW - simulation

KW - Weighted tree automaton

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

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

U2 - 10.1142/S0129054111009070

DO - 10.1142/S0129054111009070

M3 - Article

VL - 22

SP - 1845

EP - 1859

JO - International Journal of Foundations of Computer Science

JF - International Journal of Foundations of Computer Science

SN - 0129-0541

IS - 8

ER -