Weighted tree generating regular systems over strong bimonoids with reduction semantics

MaRDI QIDQ5871579zbMATH OpenFDO

Authors Dávid Kószó

Publication date 23 January 2023

Full work available at URL http://www.jalc.de/issues/2022/issue_27_4/jalc-2022-271-307.php

zbMATH Keywords

semiringstrong bimonoidweighted tree automatontree generating regular systemweighted tree generating regular system

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 6124028
• Weighted regular tree grammars with storage
• Characterizations of recognizable weighted tree languages by logic and bimorphisms
• Weighted tree automata and weighted logics
• scientific article; zbMATH DE number 2143011

Cites work

• scientific article; zbMATH DE number 3854429 (Why is no real title available?)
• scientific article; zbMATH DE number 3493901 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 619229 (Why is no real title available?)
• scientific article; zbMATH DE number 1491585 (Why is no real title available?)
• scientific article; zbMATH DE number 1358710 (Why is no real title available?)
• scientific article; zbMATH DE number 6124028 (Why is no real title available?)
• scientific article; zbMATH DE number 2211801 (Why is no real title available?)
• A Büchi-like theorem for weighted tree automata over multioperator monoids
• A Kleene theorem for weighted tree automata
• A Kleene theorem for weighted tree automata over distributive multioperator monoids
• A Medvedev characterization of recognizable tree series
• Automata, Languages and Programming
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• Crisp-determinization of weighted tree automata over additively locally finite and past-finite monotonic strong bimonoids is decidable
• Crisp-determinization of weighted tree automata over strong bimonoids
• Determinization of weighted finite automata over strong bimonoids
• Equational elements in additive algebras
• Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids
• Fuzzy tree automata
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Generalized sequential machine maps
• Handbook of weighted automata
• Local weighted tree languages
• Mappings and grammars on trees
• Recognizable formal power series on trees
• Tree acceptors and some of their applications
• Tree generating regular systems
• Weighted automata and multi-valued logics over arbitrary bounded lattices
• Weighted automata and weighted logics
• Weighted finite automata over strong bimonoids
• Weighted grammars and Kleene's theorem
• Weighted tree automata and tree transducers
• Weighted tree automata and weighted logics
• Weighted unranked tree automata over tree valuation monoids and their characterization by weighted logics

Cited in

(1)

• The supports of weighted unranked tree automata

This page was built for publication: Weighted tree generating regular systems over strong bimonoids with reduction semantics

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