Weighted regular tree grammars with storage

MaRDI QIDQ4560250zbMATH OpenFDO

Authors Luisa Herrmann, Zoltán Fülöp, Heiko Vogler

Publication date 10 December 2018

Full work available at URL https://arxiv.org/abs/1705.06681, https://dmtcs.episciences.org/4660/pdf

zbMATH Keywords

grammar with storagemulti-operator monoidtree grammarweighted MSO-logicweighted tree automatonweighted tree language

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Linear weighted tree automata with storage and inverse linear tree homomorphisms
• Weighted tree automata and weighted logics
• Characterizations of recognizable weighted tree languages by logic and bimorphisms
• Weighted automata with storage
• Weighted Languages Recognizable by Weighted Tree Automata

Cited in

(11)

• Weighted parsing for grammar-based language models over multioperator monoids
• Linear weighted tree automata with storage and inverse linear tree homomorphisms
• Principal abstract families of weighted tree languages
• Rational weighted tree languages with storage and the Kleene-Goldstine theorem
• Weighted automata with storage
• Weighted iterated linear control
• Weighted grammar tools: The GRM library
• A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
• Weighted tree generating regular systems over strong bimonoids with reduction semantics
• Rational weighted tree languages with storage
• Dynamically weighted tree transducers

This page was built for publication: Weighted regular tree grammars with storage

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4560250)