scientific article; zbMATH DE number 6124028
From MaRDI portal
Publication:4899894
zbMATH Open1265.68106MaRDI QIDQ4899894FDOQ4899894
Authors: Dragica Radovanović 
Publication date: 10 January 2013
Title of this publication is not available (Why is that?)
Recommendations
- Weighted finite automata over strong bimonoids
- Crisp-determinization of weighted tree automata over strong bimonoids
- Weighted tree automata and weighted logics
- Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids
- Determinization of weighted finite automata over strong bimonoids
- Weighted nested word automata and logics over strong bimonoids
- Weighted nested word automata and logics over strong bimonoids
- Weighted tree automata and tree transducers
- A Büchi-like theorem for weighted tree automata over multioperator monoids
- A Kleene theorem for weighted tree automata
Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)
Cited In (18)
- Weighted tree automata and weighted 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
- Sequentiality of group-weighted tree automata
- A Büchi-like theorem for weighted tree automata over multioperator monoids
- Weighted finite automata over strong bimonoids
- 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
- Weighted nested word automata and logics over strong bimonoids
- Kleene and Büchi theorems for weighted forest languages over M-monoids
- Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
- Crisp-determinization of weighted tree automata over additively locally finite and past-finite monotonic strong bimonoids is decidable
- Characterizations of recognizable weighted tree languages by logic and bimorphisms
- The supports of weighted unranked tree automata
- The relationships among several forms of weighted finite automata over strong bimonoids
- DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4899894)
