Sensing as a Complexity Measure

Shaull Almagor; Denis Kuperberg; Orna Kupferman

doi:https://doi.org/10.1142/S0129054119400203

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: Contribution to journal › Article › 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
Pages (from-to)	831-873
Number of pages	43
Journal	International Journal of Foundations of Computer Science
Volume	30
Issue number	6-7
DOIs	https://doi.org/10.1142/S0129054119400203
State	Published - 1 Sep 2019

Keywords

Automata
complexity
minimization
regular languages
sensing
ω-regular languages

All Science Journal Classification (ASJC) codes

Computer Science (miscellaneous)

Access to Document

https://doi.org/10.1142/S0129054119400203

Cite this

@article{1e771faa7cd04db9842177263e7efe39,

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.",

keywords = "Automata, complexity, minimization, regular languages, sensing, ω-regular languages",

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

note = "Publisher Copyright: {\textcopyright} 2019 World Scientific Publishing Company.",

year = "2019",

month = sep,

day = "1",

doi = "https://doi.org/10.1142/S0129054119400203",

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

volume = "30",

pages = "831--873",

journal = "International Journal of Foundations of Computer Science",

issn = "0129-0541",

publisher = "World Scientific Publishing Co. Pte Ltd",

number = "6-7",

}

TY - JOUR

T1 - Sensing as a Complexity Measure

AU - Almagor, Shaull

AU - Kuperberg, Denis

AU - Kupferman, Orna

PY - 2019/9/1

Y1 - 2019/9/1

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.

KW - Automata

KW - complexity

KW - minimization

KW - regular languages

KW - sensing

KW - ω-regular languages

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

U2 - https://doi.org/10.1142/S0129054119400203

DO - https://doi.org/10.1142/S0129054119400203

M3 - مقالة

SN - 0129-0541

VL - 30

SP - 831

EP - 873

JO - International Journal of Foundations of Computer Science

JF - International Journal of Foundations of Computer Science

IS - 6-7

ER -

Sensing as a Complexity Measure

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this