Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids
From MaRDI portal
Publication:2136289
Recommendations
- scientific article; zbMATH DE number 6124028
- Weighted finite automata over strong bimonoids
- Crisp-determinization of weighted tree automata over strong bimonoids
- Characterizations of recognizable weighted tree languages by logic and bimorphisms
- Crisp-determinization of weighted tree automata over additively locally finite and past-finite monotonic strong bimonoids is decidable
Cites work
- scientific article; zbMATH DE number 5141494 (Why is no real title available?)
- scientific article; zbMATH DE number 3932372 (Why is no real title available?)
- scientific article; zbMATH DE number 4035178 (Why is no real title available?)
- scientific article; zbMATH DE number 41838 (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 3588051 (Why is no real title available?)
- scientific article; zbMATH DE number 3623470 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- scientific article; zbMATH DE number 2040322 (Why is no real title available?)
- scientific article; zbMATH DE number 1491585 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (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 over distributive multioperator monoids
- Automata, Languages and Programming
- 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
- Cut sets as recognizable tree languages
- Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
- Determinization of weighted finite automata over strong bimonoids
- Elements of automata theory. Translated from the French by Reuben Thomas
- Fuzzy languages
- Fuzzy tree automata
- Graph expressions and graph rewritings
- Graph structure and monadic second-order logic. A language-theoretic approach
- Handbook of weighted automata
- On finite semigroups of matrices
- On the definition of a family of automata
- On the finite degree of ambiguity of finite tree automata
- Rational languages and the Burnside problem
- Recognizable formal power series on trees
- Semirings and Formal Power Series
- Some remarks on recognizable treeseries
- Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
- Weighted automata and multi-valued logics over arbitrary bounded lattices
- Weighted automata and weighted MSO logics for average and long-time behaviors
- 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
(5)- scientific article; zbMATH DE number 6124028 (Why is no real title available?)
- scientific article; zbMATH DE number 7644294 (Why is no real title available?)
- A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices
- The supports of weighted unranked tree automata
- Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata
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)
