Weighted finite automata over strong bimonoids
From MaRDI portal
Publication:845343
DOI10.1016/J.INS.2009.09.003zbMATH Open1183.68337OpenAlexW1977218932MaRDI QIDQ845343FDOQ845343
Authors: Manfred Droste, Torsten Stüber, Heiko Vogler 
Publication date: 28 January 2010
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://ul.qucosa.de/id/qucosa%3A32477
Recommendations
- Determinization of weighted finite automata over strong bimonoids
- The relationships among several forms of weighted finite automata over strong bimonoids
- scientific article; zbMATH DE number 6124028
- Congruence and minimization of deterministic weighted finite automata
- scientific article; zbMATH DE number 6719345
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Handbook of weighted automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Determinism and fuzzy automata
- Minimization of lattice finite automata and its application to the decomposition of lattice languages
- Determinization of fuzzy automata with membership values in complete residuated lattices
- On the determinization of weighted finite automata
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
- On the definition of a family of automata
- Title not available (Why is that?)
- Approximation and robustness of fuzzy finite automata
- Minimization algorithms for sequential transducers
- Digital image compression
- Weighted automata and weighted logics
- Title not available (Why is that?)
- A characterization of attributed tree transformations by a subclass of macro tree transducers
- Title not available (Why is that?)
- Title not available (Why is that?)
- The design principles of a weighted finite-state transducer library
- Cut sets as recognizable tree languages
- A note on cut-worthiness of recognizable tree series
- Applications of weighted automata in natural language processing
Cited In (43)
- Title not available (Why is that?)
- Determinations of weighted finite automata over commutative idempotent MF-semirings
- TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
- Title not available (Why is that?)
- Bideterministic weighted automata
- Weighted automata and weighted MSO logics for average and long-time behaviors
- MK-fuzzy automata and MSO logics
- The Chomsky-Schützenberger theorem for quantitative context-free languages
- Bisimulations for fuzzy automata
- McCarthy-Kleene fuzzy automata and MSO logics
- Crisp-determinization of weighted tree automata over strong bimonoids
- A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices
- Weighted Linear Dynamic Logic
- Sequentiality of group-weighted tree automata
- Nondeterministic fuzzy automata
- Valuations of weighted automata: doing it in a rational way
- An improved algorithm for determinization of weighted and fuzzy automata
- Computation of the greatest simulations and bisimulations between fuzzy automata
- Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids
- Determinization of weighted finite automata over strong bimonoids
- Weighted context-free grammars over bimonoids
- Conditions for the existence of maximal factorizations
- Weighted nested word automata and logics over strong bimonoids
- Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
- Approximated determinisation of weighted tree automata
- Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders
- Local finiteness in t-norm bimonoids: overlap cases
- Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata
- Construction of fuzzy automata from fuzzy regular expressions
- Model checking computation tree logic over finite lattices
- Congruence and minimization of deterministic weighted finite automata
- Equational weighted tree transformations
- Weighted symbolic automata with data storage
- Weighted automata with storage
- Weighted automata and logics meet computational complexity
- Bisimulation relations for weighted automata
- The supports of weighted unranked tree automata
- The relationships among several forms of weighted finite automata over strong bimonoids
- On quotients of formal power series
- Weighted automata and multi-valued logics over arbitrary bounded lattices
- Title not available (Why is that?)
- The complexity of computing the behaviour of lattice automata on infinite trees
- Nondeterministic finite automata based on quantum logic: language equivalence relation and robustness
This page was built for publication: Weighted finite automata over strong bimonoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845343)
