A Medvedev characterization of recognizable tree series

DOI10.1007/978-3-319-62809-7_15zbMATH Open1494.68178OpenAlexW2738050628MaRDI QIDQ2408804FDOQ2408804

Authors: Luisa Herrmann 

Publication date: 13 October 2017

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

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

Mathematics Subject Classification ID

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

Cited In (8)

• Myhill-Nerode Theorem for Recognizable Tree Series Revisited
• A note on cut-worthiness of recognizable tree series
• Title not available (Why is that?)
• Weighted tree-walking automata
• A link between multioperator and tree valuation automata and logics
• Learning deterministically recognizable tree series
• Title not available (Why is that?)
• Title not available (Why is that?)

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)