Sensing as a complexity measure

DOI10.1142/S0129054119400203MaRDI QIDQ5205034zbMATH OpenOpenAlexWikidataFDO

Authors Shaull Almagor, Denis Kuperberg, Orna Kupferman

Publication date 10 December 2019

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

Full work available at URL https://doi.org/10.1142/s0129054119400203

zbMATH Keywords

minimizationcomplexityautomataregular languagessensing\(\omega\)-regular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Sensing as a complexity measure
• Regular sensing
• The sensing cost of monitoring and synthesis
• scientific article; zbMATH DE number 3843141
• State complexity of regular languages

Cites work

• scientific article; zbMATH DE number 4124989 (Why is no real title available?)
• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• scientific article; zbMATH DE number 1136080 (Why is no real title available?)
• scientific article; zbMATH DE number 1161555 (Why is no real title available?)
• Analytic combinatorics
• Beyond hyper-minimisation -- minimising DBAs and DPAs is NP-complete
• Church's Problem Revisited
• Communication Complexity
• Complexity of computation on real algebraic numbers
• Compressed sensing
• Controller Synthesis with Budget Constraints
• Discounting in LTL
• Minimum Attention Controller Synthesis for Omega-Regular Objectives
• On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
• Regular sensing
• Safety, liveness and fairness in temporal logic
• The sensing cost of monitoring and synthesis
• When does abstraction help?

Cited in

(4)

• Regular sensing
• Relativization of complexity and sensitivity
• The sensing cost of monitoring and synthesis
• Sensing as a complexity measure

This page was built for publication: Sensing as a complexity measure

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