WEIGHTED NESTED WORD AUTOMATA AND LOGICS OVER STRONG BIMONOIDS

DOI10.1142/S0129054114500269zbMath1310.68129MaRDI QIDQ2929640

Bundit Pibaljommee, Manfred Droste

Publication date: 14 November 2014

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

monadic second-order logicformal power seriesweighted automataweighted logicsnested wordsbimonoidsnested automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70)

Related Items (3)

Generalizing input-driven languages: theoretical and practical benefits ⋮ Weighted operator precedence languages ⋮ Weighted Operator Precedence Languages

Cites Work

• Automata theory based on quantum logic: Some characterizations
• Weighted automata and multi-valued logics over arbitrary bounded lattices
• Weighted finite automata over strong bimonoids
• Determinization of weighted finite automata over strong bimonoids
• Minimization algorithms for sequential transducers
• Automata theory based on quantum logic. I
• Weighted automata and weighted logics
• Automata theory based on quantum logic: reversibilities and pushdown automata
• A theory of computation based on quantum logic. I
• The logic of quantum mechanics
• On the definition of a family of automata
• Weighted Logics for Nested Words and Algebraic Formal Power Series

This page was built for publication: WEIGHTED NESTED WORD AUTOMATA AND LOGICS OVER STRONG BIMONOIDS