Abstract
We explore the suitability of mod 2 multiplicity automata (M2MAs) as a representation for regular languages of infinite words. M2MAs are a deterministic representation that is known to be learnable in polynomial time with membership and equivalence queries, in contrast to many other representations. Another advantage of M2MAs compared to non-deterministic automata is that their equivalence can be decided in polynomial time and complementation incurs only an additive constant size increase. Because learning time is parameterized by the size of the representation, particular attention is focused on the relative succinctness of alternate representations, in particular, LTL formulas and Büchi automata of the types: deterministic, non-deterministic and strongly unambiguous. We supplement the theoretical results of worst case upper and lower bounds with experimental results computed for randomly generated automata and specific families of LTL formulas.
Chapter PDF
Similar content being viewed by others
References
Angluin, D., Antonopoulos, T., Fisman, D.: Strongly unambiguous Büchi automata are polynomially predictable with membership queries. In: 28th EACSL Annual Conference on Computer Science Logic, CSL. pp. 8:1–8:17 (2020)
Angluin, D., Fisman, D.: Learning regular omega languages. Theor. Comput. Sci. 650, 57–72 (2016)
Baier, C., Katoen, J.: Principles of Model Checking. MIT Press (2008)
Beimel, A., Bergadano, F., Bshouty, N.H., Kushilevitz, E., Varricchio, S.: Learning functions represented as multiplicity automata. J. ACM 47(3), 506–530 (May 2000)
Bergadano, F., Varricchio, S.: Learning behaviors of automata from multiplicity and equivalence queries. SIAM J. Comput. 25(6), 1268–1280 (1996)
Bousquet, N., Löding, C.: Equivalence and inclusion problem for strongly unambiguous Büchi automata. In: Language and Automata Theory and Applications, 4th International Conference, LATA. Proceedings. pp. 118–129 (2010). https://doi.org/10.1007/978-3-642-13089-2_10
Calbrix, H., Nivat, M., Podelski, A.: Ultimately periodic words of rational w-languages. In: Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics. pp. 554–566. Springer-Verlag (1994)
Carton, O., Michel, M.: Unambiguous Büchi automata. Theor. Comput. Sci. 297(1-3), 37–81 (2003). https://doi.org/10.1016/S0304-3975(02)00618-7
Diekert, V., Gastin, P.: First-order definable languages. In: Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]. pp. 261–306 (2008)
Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of Weighted Automata, chap. 4: Rational and Recognizable Series, by Jaques Sakarovitch, pp. 105–174. Springer-Verlag Berlin Heidelberg (2009)
Gerth, R., Peled, D., Vardi, M., Wolper, P.: Simple on-the-fly automatic verification of linear temporal logic. In: Protocol Specification, Testing and Verification XV. PSTV 1995. Springer (1996). https://doi.org/10.1007/978-0-387-34892-6_1
Hromkovič, J.: Communication Complexity and Parallel Computing. Springer-Verlag Berlin Heidelberg (1997), (There is also 2013 edition.)
Kaznatcheev, A., Panangaden, P.: Weighted automata are compact and actively learnable. Information Processing Letters 171 (2021), (The authors were apparently unaware of prior results on learning multiplicity automata by Beimel et al. and others.)
Kuperberg, D., Pinault, L., Pous, D.: Coinductive algorithms for Büchi automata. In: Developments in Language Theory - 23rd International Conference, DLT Proceedings. pp. 206–220 (2019)
Manna, Z., Pnueli, A.: A hierarchy of temporal properties (invited paper, 1989). In: Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing. p. 377–410. PODC ’90, Association for Computing Machinery (1990). https://doi.org/10.1145/93385.93442
Michel, M.: Complementation is much more difficult with automata on infinite words. In: Manuscript, CNET (1988)
Moser, B.K.: Linear algebra and related introductory topics. In: Linear Models, A Mean Model Approach, A volume in Probability and Mathematical Statistics. pp. 1–22 (1996)
Pnueli, A.: The temporal logic of programs. In: FOCS. pp. 46–57 (1977)
Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, USA (2009)
Vardi, M.Y.: An automata-theoretic approach to linear temporal logic. In: Logics for Concurrency - Structure versus Automata (8th Banff Higher Order Workshop, Banff, Canada, August 27 - September 3, 1995, Proceedings). pp. 238–266 (1995). https://doi.org/10.1007/3-540-60915-6_6
Wilke, T.: \(\omega \)-automata. CoRR abs/1609.03062 (2016), http://arxiv.org/abs/1609.03062
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Open Access This chapter is licensed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.
The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.
Copyright information
© 2022 The Author(s)
About this paper
Cite this paper
Angluin, D., Antonopoulos, T., Fisman, D., George, N. (2022). Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata. In: Bouyer, P., Schröder, L. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2022. Lecture Notes in Computer Science, vol 13242. Springer, Cham. https://doi.org/10.1007/978-3-030-99253-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-030-99253-8_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-99252-1
Online ISBN: 978-3-030-99253-8
eBook Packages: Computer ScienceComputer Science (R0)