Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids

Cites Work

Elements of automata theory. Translated from the French by Reuben Thomas
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Handbook of weighted automata
Title not available (Why is that?)
Fuzzy Languages
Determinization of weighted finite automata over strong bimonoids
On the definition of a family of automata
Title not available (Why is that?)
On finite semigroups of matrices
Title not available (Why is that?)
Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
Semirings and Formal Power Series
Rational languages and the Burnside problem
Weighted Tree Automata and Tree Transducers
Automata, Languages and Programming
Weighted finite automata over strong bimonoids
Weighted automata and weighted MSO logics for average and long-time behaviors
Multi-weighted automata and MSO logic
Weighted automata and multi-valued logics over arbitrary bounded lattices
Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
Weighted tree automata and weighted logics
Recognizable formal power series on trees
On the finite degree of ambiguity of finite tree automata
Title not available (Why is that?)
Graph expressions and graph rewritings
Title not available (Why is that?)
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?)
Cut sets as recognizable tree languages
Some remarks on recognizable treeseries
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
Title not available (Why is that?)

Cited In (5)

Title not available (Why is that?)
A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices
Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata
The supports of weighted unranked tree automata
Title not available (Why is that?)

This page was built for publication: Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids

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