Publication:515684

DOI10.1016/j.ic.2016.06.010zbMath1364.68249arXiv1506.07031MaRDI QIDQ515684

Stefan Dück, Manfred Droste

Publication date: 16 March 2017

Published in: Information and Computation, Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.07031

zbMATH Keywords

weighted automata; weighted logics; nested words; quantitative automata; valuation monoids

Mathematics Subject Classification ID

68Q45: Formal languages and automata

03D05: Automata and formal grammars in connection with logical questions

Related Items

Unnamed Item, Weighted Operator Precedence Languages, Weighted automata and logics for infinite nested words, Generalizing input-driven languages: theoretical and practical benefits, Weighted operator precedence languages, Weighted automata, Weighted Automata and Logics on Infinite Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weighted automata and logics for infinite nested words
• Weighted automata and multi-valued logics over arbitrary bounded lattices
• Handbook of weighted automata
• Weighted tree automata and weighted logics
• Weighted automata and weighted MSO logics for average and long-time behaviors
• Weighted automata and weighted logics
• Weighted logics for unranked tree automata
• Tree acceptors and some of their applications
• Weighted Nested Word Automata and Logics over Strong Bimonoids
• Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
• Weak Second‐Order Arithmetic and Finite Automata
• On the definition of a family of automata
• Adding nesting structure to words
• Weighted Logics for Nested Words and Algebraic Formal Power Series
• Quantitative Languages
• Weighted Automata and Weighted Logics on Infinite Words
• First-Order and Temporal Logics for Nested Words
• Weighted versus Probabilistic Logics
• Decision Problems of Finite Automata Design and Related Arithmetics
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Decidability of Second-Order Theories and Automata on Infinite Trees