TY - GEN
T1 - Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata.
AU - Angluin, Dana
AU - Antonopoulos, Timos
AU - Fisman, Dana
AU - George, Nevin
N1 - DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.
PY - 2022/3/29
Y1 - 2022/3/29
N2 - 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 Buchi 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.
AB - 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 Buchi 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.
KW - Büchi Automata
KW - Conciseness
KW - Linear Temporal Logic
KW - Multiplicity Automata
KW - Regular Omega Languages
UR - http://www.scopus.com/inward/record.url?scp=85128456807&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-99253-8_1
DO - 10.1007/978-3-030-99253-8_1
M3 - Conference contribution
SN - 9783030992521
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 1
EP - 20
BT - Foundations of Software Science and Computation Structures - FoSSaCS 2022
A2 - Bouyer, Patricia
A2 - Schröder, Lutz
PB - Springer
CY - Cham
T2 - 25th International Conference on Foundations of Software Science and Computation Structures, FoSSaCS 2022, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022
Y2 - 4 April 2022 through 6 April 2022
ER -