Pushing for Weighted Tree Automata

DOI10.1007/978-3-642-22993-0_42zbMath1343.68146arXiv1702.00304OpenAlexW2185464796MaRDI QIDQ3088063

Andreas Maletti, Daniel Quernheim, Thomas Hanneforth

Publication date: 17 August 2011

Published in: Mathematical Foundations of Computer Science 2011 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1702.00304

zbMATH Keywords

minimizationequivalence testingweighted tree automatonpushing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (3)

Compositions of constant weighted extended tree transducers ⋮ Compositions with Constant Weighted Extended Tree Transducers ⋮ From tree automata to string automata minimization

This page was built for publication: Pushing for Weighted Tree Automata