-Treeautomata and their relation to weighted context-free grammars

DOI10.1080/00207168908803687MaRDI QIDQ3816997zbMATH OpenOpenAlexFDO

Authors I. Tsomokos

Publication date 1989

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207168908803687

zbMATH Keywords

normalizationrecognizable tree seriessemiringtree automataweighted context free grammars

Mathematics Subject Classification ID

Semirings (16Y60) Formal languages and automata (68Q45)

Recommendations

• Kleene type results for weighted tree automata
• A Kleene theorem for weighted tree automata
• Weighted tree automata and tree transducers
• A Kleene theorem for weighted tree automata over tree valuation monoids
• A Kleene theorem for weighted tree automata over tree valuation monoids
• Developments in Language Theory
• RELATING TREE SERIES TRANSDUCERS AND WEIGHTED TREE AUTOMATA
• Weighted tree automata and weighted logics
• Weighted Languages Recognizable by Weighted Tree Automata
• \(K\)-position, follow, equation and \(K\)-C-continuation tree automata constructions

Cites work

• Generalized sequential machine maps
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 3588051 (Why is no real title available?)
• Mappings and grammars on trees
• The rank of a formal tree power series
• Weighted grammars and Kleene's theorem

Cited in

(4)

• Context-free series on trees
• On the Mild Context-Sensitivity of k-Tree Wrapping Grammar
• scientific article; zbMATH DE number 3854428 (Why is no real title available?)
• scientific article; zbMATH DE number 2211801 (Why is no real title available?)

This page was built for publication: -Treeautomata and their relation to weighted context-free grammars

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