A Medvedev characterization of recognizable tree series

DOI10.1007/978-3-319-62809-7_15MaRDI QIDQ2408804zbMATH OpenOpenAlexFDO

Authors Luisa Herrmann

Publication date 13 October 2017

Full work available at URL https://doi.org/10.1007/978-3-319-62809-7_15

Mathematics Subject Classification ID

Higher-order logic (03B16) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70)

Recommendations

• Weighted tree automata and weighted logics
• Weighted tree automata and tree transducers
• scientific article; zbMATH DE number 708666
• Some remarks on recognizable treeseries
• Characterizations of recognizable weighted tree languages by logic and bimorphisms

Cited in

(9)

• A link between multioperator and tree valuation automata and logics
• Recognizable series on hypergraphs
• Weighted tree-walking automata
• scientific article; zbMATH DE number 5854945 (Why is no real title available?)
• Learning deterministically recognizable tree series
• scientific article; zbMATH DE number 708666 (Why is no real title available?)
• Myhill-Nerode Theorem for Recognizable Tree Series Revisited
• Weighted tree generating regular systems over strong bimonoids with reduction semantics
• A note on cut-worthiness of recognizable tree series

This page was built for publication: A Medvedev characterization of recognizable tree series

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