Weighted nested word automata and logics over strong bimonoids
DOI10.1142/S0129054114500269zbMATH Open1310.68129MaRDI QIDQ2929640FDOQ2929640
Authors: Bundit Pibaljommee, Manfred Droste 
Publication date: 14 November 2014
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Recommendations
- Weighted nested word automata and logics over strong bimonoids
- Weighted finite automata over strong bimonoids
- scientific article; zbMATH DE number 6124028
- Weighted automata and logics for infinite nested words
- Weighted automata and logics for infinite nested words
- Determinization of weighted finite automata over strong bimonoids
- The relationships among several forms of weighted finite automata over strong bimonoids
- Automata, Languages and Programming
- Weighted automata and weighted logics
- Weighted automata and weighted logics
formal power seriesmonadic second-order logicweighted automatanested wordsweighted logicsbimonoidsnested automata
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70)
Cites Work
- The logic of quantum mechanics
- Determinization of weighted finite automata over strong bimonoids
- On the definition of a family of automata
- Minimization algorithms for sequential transducers
- Automata theory based on quantum logic. I
- Automata theory based on quantum logic: reversibilities and pushdown automata
- A theory of computation based on quantum logic. I
- Automata theory based on quantum logic: Some characterizations
- Weighted finite automata over strong bimonoids
- Weighted automata and weighted logics
- Weighted automata and multi-valued logics over arbitrary bounded lattices
- Weighted logics for nested words and algebraic formal power series
Cited In (11)
- Title not available (Why is that?)
- Bidirectional nested weighted automata
- Weighted nested word automata and logics over strong bimonoids
- Weighted Logics for Nested Words and Algebraic Formal Power Series
- Weighted Operator Precedence Languages
- Weighted logics for nested words and algebraic formal power series
- Weighted specifications over nested words
- Weighted operator precedence languages
- A Nivat theorem for weighted picture automata and weighted MSO logics
- Weighted automata and logics for infinite nested words
- Generalizing input-driven languages: theoretical and practical benefits
This page was built for publication: Weighted nested word automata and logics over strong bimonoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2929640)
