Abstract
A complexity measure for regular languages based on the sensing required to recognize them was recently introduced by Almagor, Kuperberg, and Kupferman. 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, when the input letters composing the word are truth assignments to a finite set of signals. We introduce the notion of lazy sensing, where the signals are not sensed simultaneously. Rather, the signals are ordered, and a signal is sensed only if the values of the signals sensed so far have not determined the successor state. We study four classes of lazy sensing, induced by distinguishing between the cases where the order of the signals is static or dynamic (that is, fixed in advance or depends on the values of the signals sensed so far), and the cases where the order is global or local (that is, the same for all states of the automaton, or not). We examine the different classes of lazy sensing and the saving they enable, with respect to each other and with respect to (non-lazy) sensing. We also examine the trade offs between sensing cost and size. Our results show that the good properties of sensing are preserved in the lazy setting. In particular, saving sensing does not conflict with saving size: in all four classes, the lazy-sensing cost of a regular language can be attained in the minimal automaton recognizing the language.
Work partially supported by the Israel Science Foundation, ISF grant agreement no 2357/19.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Note that the above definition of a reduced tree is syntactic, in the sense it examines whether subtrees are identical. An alternative semantic definition removes a vertex if its two children root subtrees that represent the same function. Since the order of the signals along different paths may be different, two subtrees that represent the same function need not be identical, even if both are reduced. Thus, the semantic definition may result in smaller sensing trees. However, reducing trees according to the semantic definition is more complex. All our results apply also to the semantic definition.
References
Almagor, S., Kuperberg, D., Kupferman, O.: Regular sensing. In: Proceedings of 34th Conference on Foundations of Software Technology and Theoretical Computer Science. LIPIcs, vol. 29, pp. 161–173. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany (2014)
Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, L.J.: Symbolic model checking: \(10^{20}\) states and beyond. Inf. Comput. 98(2), 142–170 (1992)
Donoho, D.L.: Compressed sensing. IEEE Trans. Inform. Theory 52, 1289–1306 (2006)
Grinstead, C., Laurie Snell, J.: 11: Markov chains. In: Introduction to Probability. American Mathematical Society (1997)
Kindler, G.: Property testing, PCP, and Juntas. Ph.D. thesis, Tel Aviv University University (2002)
Miller, D.M., Drechsler, R.: On the construction of multiple-valued decision diagrams. In: 32nd IEEE International Symposium on Multiple-Valued Logic, pp. 245–253. IEEE Computer Society (2002)
Minker, J., Minker, R.G.: Optimization of Boolean expressions-historical developments. IEEE Ann. Hist. Comput. 2(3), 227–238 (1980)
Muthukrishnan, S.: Theory of data stream computing: where to go. In: Proceedings of 30th Symposium on Principles of Database Systems, pp. 317–319 (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 IFIP International Federation for Information Processing
About this paper
Cite this paper
Kupferman, O., Petruschka, A. (2022). Lazy Regular Sensing. In: Han, YS., Vaszil, G. (eds) Descriptional Complexity of Formal Systems. DCFS 2022. Lecture Notes in Computer Science, vol 13439. Springer, Cham. https://doi.org/10.1007/978-3-031-13257-5_12
Download citation
DOI: https://doi.org/10.1007/978-3-031-13257-5_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-13256-8
Online ISBN: 978-3-031-13257-5
eBook Packages: Computer ScienceComputer Science (R0)
