Weighted Symbolic Automata with Data Storage

DOI10.1007/978-3-662-53132-7_17zbMath1436.68172OpenAlexW2493972230MaRDI QIDQ2817389

Luisa Herrmann, Heiko Vogler

Publication date: 30 August 2016

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

Full work available at URL: https://doi.org/10.1007/978-3-662-53132-7_17

Mathematics Subject Classification ID

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

Related Items (4)

Symbolic weighted language models, quantitative parsing and automated music transcription ⋮ Quantitative monitoring of STL with edit distance ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Symbolic tree automata
• MSO logics for weighted timed automata
• A Büchi-like theorem for weighted tree automata over multioperator monoids
• Handbook of weighted automata
• Weighted finite automata over strong bimonoids
• Some definitional suggestions for automata theory
• A Weighted MSO Logic with Storage Behaviour and Its Büchi-Elgot-Trakhtenbrot Theorem
• The Support of a Recognizable Series over a Zero-sum Free, Commutative Semiring is Recognizable
• A Chomsky-Schützenberger Theorem for Weighted Automata with Storage
• Describing Average- and Longtime-Behavior by Weighted MSO Logics
• Symbolic Automata Constraint Solving
• A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic
• The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages
• Applications of Symbolic Finite Automata
• Automata, Languages and Programming

This page was built for publication: Weighted Symbolic Automata with Data Storage