Semirings, automata, languages
Semirings, automata, languages
Rational series and their languages
Rational series and their languages
Minimization algorithms for sequential transducers
Theoretical Computer Science
Automata, Languages, and Machines
Automata, Languages, and Machines
Automata: Theoretic Aspects of Formal Power Series
Automata: Theoretic Aspects of Formal Power Series
Automata theory based on quantum logic: some characterizations
Information and Computation
A theory of computation based on quantum logic (I)
Theoretical Computer Science
Weighted automata and weighted logics
Theoretical Computer Science
Automata theory based on quantum logic: Reversibilities and pushdown automata
Theoretical Computer Science
Adding nesting structure to words
Journal of the ACM (JACM)
Weighted versus Probabilistic Logics
DLT '09 Proceedings of the 13th International Conference on Developments in Language Theory
Weighted finite automata over strong bimonoids
Information Sciences: an International Journal
Handbook of Weighted Automata
Determinization of weighted finite automata over strong bimonoids
Information Sciences: an International Journal
Deductive multi-valued model checking
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Weighted automata and multi-valued logics over arbitrary bounded lattices
Theoretical Computer Science
| Hi-index | 0.00 |
Nested words have been introduced by Alur and Madhusudan as a model for e.g. recursive programs or XML documents and have received much recent interest. In this paper, we investigate a quantitative automaton model and a quantitative logic for nested words. The behavior resp. the semantics map nested words to weights taken from a strong bimonoid. Strong bimonoids can be viewed as semirings without requiring the distributivity assumption which was essential in the classical theory of formal power series; strong bimonoids include e.g. all bounded lattices and many other structures from multi-valued logics. Our main results show that weighted nested word automata and suitable weighted MSO logics are expressively equivalent. This extends the classical Büchi-Elgot result from words to a weighted setting for nested words.