Weighted tree generating regular systems over strong bimonoids with reduction semantics

MaRDI QIDQ5871579FDOQ5871579

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

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

zbMATH Keywords

semiringstrong bimonoidweighted tree automatontree generating regular systemweighted tree generating regular system

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Handbook of weighted automata
• Determinization of weighted finite automata over strong bimonoids
• Title not available (Why is that?)
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• Generalized sequential machine maps
• Weighted tree automata and tree transducers
• Mappings and grammars on trees
• Tree acceptors and some of their applications
• Tree generating regular systems
• Automata, Languages and Programming
• Weighted finite automata over strong bimonoids
• Weighted automata and weighted logics
• Weighted automata and multi-valued logics over arbitrary bounded lattices
• Weighted tree automata and weighted logics
• Title not available (Why is that?)
• Recognizable formal power series on trees
• Equational elements in additive algebras
• A Kleene theorem for weighted tree automata
• Weighted grammars and Kleene's theorem
• A Kleene theorem for weighted tree automata over distributive multioperator monoids
• Fuzzy tree automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Büchi-like theorem for weighted tree automata over multioperator monoids
• Title not available (Why is that?)
• Weighted unranked tree automata over tree valuation monoids and their characterization by weighted logics
• Title not available (Why is that?)
• 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
• Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids
• A Medvedev characterization of recognizable tree series
• Local weighted tree languages

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)