Definability and transformations for cost logics and automatic structures

DOI10.1007/978-3-662-44522-8_33MaRDI QIDQ2922032zbMATH OpenOpenAlexFDO

Authors Martin Lang, Christof Löding, Amaldev Manuel

Publication date 14 October 2014

Published in Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-44522-8_33

Mathematics Subject Classification ID

Classical first-order logic (03B10) Computable structure theory, computable model theory (03C57) Automata and formal grammars in connection with logical questions (03D05)

Recommendations

• On the Expressive Power of Cost Logics over Infinite Words
• Two-way cost automata and cost logics over infinite trees
• Regular cost functions. I: Logic and algebra over words
• Theories of Automatic Structures and Their Complexity
• Logic and regular cost functions

Cited in

(2)

• Definability and automorphisms in abstract logics
• Cost functions definable by min/max automata

This page was built for publication: Definability and transformations for cost logics and automatic structures

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