A Kleene theorem for weighted tree automata
From MaRDI portal
Publication:1764423
DOI10.1007/s00224-004-1096-zzbMath1061.68092MaRDI QIDQ1764423
Heiko Vogler, Christian Pech, Manfred Droste
Publication date: 24 February 2005
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-004-1096-z
68Q45: Formal languages and automata
Related Items
Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations, A Büchi-like theorem for weighted tree automata over multioperator monoids, A note on cut-worthiness of recognizable tree series, Weighted tree automata and weighted logics, Schützenberger's theorem on formal power series follows from Kleene's theorem, A Kleene theorem for weighted tree automata over distributive multioperator monoids, A Kleene theorem for weighted tree automata over tree valuation monoids, A link between multioperator and tree valuation automata and logics, Cut sets as recognizable tree languages, Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics, A Kleene Theorem for Forest Languages, DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA, Automatic Termination