Definable Transductions and Weighted Logics for Texts

DOI10.1007/978-3-540-73208-2_31MaRDI QIDQ5428243zbMATH OpenOpenAlexFDO

Authors Christian Mathissen

Publication date 28 November 2007

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73208-2_31

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)

Recommendations

• Definable transductions and weighted logics for texts
• Weighted Logics for Traces
• MSO definable text languages
• Weighted automata and weighted logics
• Weighted automata and weighted logics

Cited in

(18)

• T-structures, T-functions, and texts
• Definable transductions and weighted logics for texts
• Weighted automata and weighted logics with discounting
• Weighted automata and weighted logics
• A Büchi-like theorem for weighted tree automata over multioperator monoids
• Weighted logics for unranked tree automata
• A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic.
• Weighted picture automata and weighted logics
• Weighted Logics for Nested Words and Algebraic Formal Power Series
• Varieties of recognizable tree series over fields
• MSO definable text languages
• Existential MSO over two successors is strictly weaker than over linear orders
• Weighted Automata and Weighted Logics with Discounting
• Weighted Logics for Traces
• MSO logics for weighted timed automata
• Weighted Timed MSO Logics
• Weighted automata and multi-valued logics over arbitrary bounded lattices
• A logic-based approach to incremental reasoning on multi-agent systems

This page was built for publication: Definable Transductions and Weighted Logics for Texts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5428243)