Minimizing deterministic weighted tree automata
type: Item
instance of: scholarly article
title: Minimizing deterministic weighted tree automata
zbMATH Open document ID: 1192.68418
author: Andreas Maletti
published in: Information and Computation
publication date: 2009-11-27T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5639688
zbMATH Keywords: weighted tree automaton
zbMATH Keywords: minimization
zbMATH Keywords: tree series
zbMATH Keywords: determinism
zbMATH Keywords: partition refinement
describes a project that uses: FIRE station
describes a project that uses: OpenFst
describes a project that uses: Tiburon
describes a project that uses: Carmel
MaRDI profile type: Publication
full work available at URL: j.ic.2009.01.004
OpenAlex ID: W2132629030
cites work: The rank of a formal tree power series
cites work: Equational elements in additive algebras
cites work: On the Determinization of Weighted Finite Automata
cites work: Q3704880
cites work: Q4179852
cites work: Implementation and Application of Automata
cites work: OpenFst: A General and Efficient Weighted Finite-State Transducer Library
cites work: Tiburon: A Weighted Tree Automata Toolkit
cites work: Minimizing Deterministic Weighted Tree Automata
cites work: Q4452058
cites work: Q5694616
cites work: Effective construction of the syntactic algebra of a recognizable series on trees
cites work: Learning regular sets from queries and counterexamples
cites work: Learning Multiplicity Tree Automata
cites work: Q3517256
cites work: Learning Deterministically Recognizable Tree Series — Revisited
cites work: Deciding Equivalence of Finite Tree Automata
cites work: Minimization algorithms for sequential transducers
cites work: Learning tree languages from positive examples and membership queries
cites work: Backward and Forward Bisimulation Minimisation of Tree Automata
cites work: Q4045961
DOI: 10.1016/J.IC.2009.01.004
description: scientific article; zbMATH DE number 5639688