Sensing as a complexity measure

DOI10.1142/S0129054119400203zbMATH Open1427.68136OpenAlexW3022947165WikidataQ127226597 ScholiaQ127226597MaRDI QIDQ5205034FDOQ5205034

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

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

zbMATH Keywords

minimizationcomplexityautomataregular languagessensing\(\omega\)-regular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

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

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)