Sensing as a complexity measure

Shaull Almagor; Denis Kuperberg; Orna Kupferman

doi:https://doi.org/10.1007/978-3-319-60252-3_1

Sensing as a complexity measure

Shaull Almagor, Denis Kuperberg, Orna Kupferman

The Rachel and Selim Benin School of Engineering and Computer Science

The Hebrew University of Jerusalem

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

The size of deterministic automata required for recognizing regular and ω-regular languages is a well-studied measure for the complexity of languages. We introduce and study a new complexity measure, based on the sensing required for recognizing the language. Intuitively, the sensing cost quantifies the detail in which a random input word has to be read in order to decide its membership in the language. We study the sensing cost of regular and ω-regular languages, as well as applications of the study in practice, especially in the monitoring and synthesis of reactive systems.

Original language	English
Title of host publication	Descriptional Complexity of Formal Systems - 19th IFIP WG 1.02 International Conference, DCFS 2017, Proceedings
Editors	Giovanni Pighizzini, Cezar Campeanu
Pages	3-15
Number of pages	13
DOIs	https://doi.org/10.1007/978-3-319-60252-3_1
State	Published - 2017
Event	19th International Conference of Descriptional Complexity of Formal Systems, DCFS 2017 - Milano, Italy Duration: 3 Jul 2017 → 5 Jul 2017

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	10316 LNCS

Conference

Conference	19th International Conference of Descriptional Complexity of Formal Systems, DCFS 2017
Country/Territory	Italy
City	Milano
Period	3/07/17 → 5/07/17

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

https://doi.org/10.1007/978-3-319-60252-3_1

Cite this

Almagor, S., Kuperberg, D., & Kupferman, O. (2017). Sensing as a complexity measure. In G. Pighizzini, & C. Campeanu (Eds.), Descriptional Complexity of Formal Systems - 19th IFIP WG 1.02 International Conference, DCFS 2017, Proceedings (pp. 3-15). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10316 LNCS). https://doi.org/10.1007/978-3-319-60252-3_1

Almagor, Shaull ; Kuperberg, Denis ; Kupferman, Orna. / Sensing as a complexity measure. Descriptional Complexity of Formal Systems - 19th IFIP WG 1.02 International Conference, DCFS 2017, Proceedings. editor / Giovanni Pighizzini ; Cezar Campeanu. 2017. pp. 3-15 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{17da532f15f7485e982b161b5e06985f,

title = "Sensing as a complexity measure",

abstract = "The size of deterministic automata required for recognizing regular and ω-regular languages is a well-studied measure for the complexity of languages. We introduce and study a new complexity measure, based on the sensing required for recognizing the language. Intuitively, the sensing cost quantifies the detail in which a random input word has to be read in order to decide its membership in the language. We study the sensing cost of regular and ω-regular languages, as well as applications of the study in practice, especially in the monitoring and synthesis of reactive systems.",

author = "Shaull Almagor and Denis Kuperberg and Orna Kupferman",

note = "Publisher Copyright: {\textcopyright} IFIP International Federation for Information Processing 2017.; 19th International Conference of Descriptional Complexity of Formal Systems, DCFS 2017 ; Conference date: 03-07-2017 Through 05-07-2017",

year = "2017",

doi = "https://doi.org/10.1007/978-3-319-60252-3_1",

language = "الإنجليزيّة",

isbn = "9783319602516",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "3--15",

editor = "Giovanni Pighizzini and Cezar Campeanu",

booktitle = "Descriptional Complexity of Formal Systems - 19th IFIP WG 1.02 International Conference, DCFS 2017, Proceedings",

}

Almagor, S, Kuperberg, D & Kupferman, O 2017, Sensing as a complexity measure. in G Pighizzini & C Campeanu (eds), Descriptional Complexity of Formal Systems - 19th IFIP WG 1.02 International Conference, DCFS 2017, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10316 LNCS, pp. 3-15, 19th International Conference of Descriptional Complexity of Formal Systems, DCFS 2017, Milano, Italy, 3/07/17. https://doi.org/10.1007/978-3-319-60252-3_1

Sensing as a complexity measure. / Almagor, Shaull; Kuperberg, Denis; Kupferman, Orna.
Descriptional Complexity of Formal Systems - 19th IFIP WG 1.02 International Conference, DCFS 2017, Proceedings. ed. / Giovanni Pighizzini; Cezar Campeanu. 2017. p. 3-15 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10316 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Sensing as a complexity measure

AU - Almagor, Shaull

AU - Kuperberg, Denis

AU - Kupferman, Orna

PY - 2017

Y1 - 2017

N2 - The size of deterministic automata required for recognizing regular and ω-regular languages is a well-studied measure for the complexity of languages. We introduce and study a new complexity measure, based on the sensing required for recognizing the language. Intuitively, the sensing cost quantifies the detail in which a random input word has to be read in order to decide its membership in the language. We study the sensing cost of regular and ω-regular languages, as well as applications of the study in practice, especially in the monitoring and synthesis of reactive systems.

AB - The size of deterministic automata required for recognizing regular and ω-regular languages is a well-studied measure for the complexity of languages. We introduce and study a new complexity measure, based on the sensing required for recognizing the language. Intuitively, the sensing cost quantifies the detail in which a random input word has to be read in order to decide its membership in the language. We study the sensing cost of regular and ω-regular languages, as well as applications of the study in practice, especially in the monitoring and synthesis of reactive systems.

UR - http://www.scopus.com/inward/record.url?scp=85022325019&partnerID=8YFLogxK

U2 - https://doi.org/10.1007/978-3-319-60252-3_1

DO - https://doi.org/10.1007/978-3-319-60252-3_1

M3 - منشور من مؤتمر

SN - 9783319602516

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 3

EP - 15

BT - Descriptional Complexity of Formal Systems - 19th IFIP WG 1.02 International Conference, DCFS 2017, Proceedings

A2 - Pighizzini, Giovanni

A2 - Campeanu, Cezar

T2 - 19th International Conference of Descriptional Complexity of Formal Systems, DCFS 2017

Y2 - 3 July 2017 through 5 July 2017

ER -

Almagor S, Kuperberg D, Kupferman O. Sensing as a complexity measure. In Pighizzini G, Campeanu C, editors, Descriptional Complexity of Formal Systems - 19th IFIP WG 1.02 International Conference, DCFS 2017, Proceedings. 2017. p. 3-15. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: https://doi.org/10.1007/978-3-319-60252-3_1

Sensing as a complexity measure

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this