Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata

Dana Angluin; Timos Antonopoulos; Dana Fisman; Nevin George

doi:https://doi.org/10.1007/978-3-030-99253-8_1

Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata

Dana Angluin, Timos Antonopoulos, Dana Fisman, Nevin George

Department of Computer Science

Ben-Gurion University of the Negev

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

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.

Original language	American English
Title of host publication	Foundations of Software Science and Computation Structures - 25th International Conference, FOSSACS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Proceedings
Editors	Patricia Bouyer, Lutz Schröder
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	1-20
Number of pages	20
ISBN (Print)	9783030992521
DOIs	https://doi.org/10.1007/978-3-030-99253-8_1
State	Published - 1 Jan 2022
Event	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 - Munich, Germany Duration: 4 Apr 2022 → 6 Apr 2022

Publication series

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

Conference

Conference	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
Country/Territory	Germany
City	Munich
Period	4/04/22 → 6/04/22

Keywords

Büchi Automata
Conciseness
Linear Temporal Logic
Multiplicity Automata
Regular Omega Languages

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

https://doi.org/10.1007/978-3-030-99253-8_1

Cite this

Angluin, D., Antonopoulos, T., Fisman, D., & George, N. (2022). Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata. In P. Bouyer, & L. Schröder (Eds.), Foundations of Software Science and Computation Structures - 25th International Conference, FOSSACS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Proceedings (pp. 1-20). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13242 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-99253-8_1

Angluin, Dana ; Antonopoulos, Timos ; Fisman, Dana et al. / Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata. Foundations of Software Science and Computation Structures - 25th International Conference, FOSSACS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Proceedings. editor / Patricia Bouyer ; Lutz Schröder. Springer Science and Business Media Deutschland GmbH, 2022. pp. 1-20 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{99c2b26bd2f24f51861a4eb21fa965c1,

title = "Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata",

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{\"u}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.",

keywords = "B{\"u}chi Automata, Conciseness, Linear Temporal Logic, Multiplicity Automata, Regular Omega Languages",

author = "Dana Angluin and Timos Antonopoulos and Dana Fisman and Nevin George",

note = "Publisher Copyright: {\textcopyright} 2022, The Author(s).; 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 ; Conference date: 04-04-2022 Through 06-04-2022",

year = "2022",

month = jan,

day = "1",

doi = "https://doi.org/10.1007/978-3-030-99253-8_1",

language = "American English",

isbn = "9783030992521",

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

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "1--20",

editor = "Patricia Bouyer and Lutz Schr{\"o}der",

booktitle = "Foundations of Software Science and Computation Structures - 25th International Conference, FOSSACS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Proceedings",

address = "Germany",

}

Angluin, D, Antonopoulos, T, Fisman, D & George, N 2022, Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata. in P Bouyer & L Schröder (eds), Foundations of Software Science and Computation Structures - 25th International Conference, FOSSACS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 13242 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 1-20, 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, Munich, Germany, 4/04/22. https://doi.org/10.1007/978-3-030-99253-8_1

Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata. / Angluin, Dana; Antonopoulos, Timos; Fisman, Dana et al.
Foundations of Software Science and Computation Structures - 25th International Conference, FOSSACS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Proceedings. ed. / Patricia Bouyer; Lutz Schröder. Springer Science and Business Media Deutschland GmbH, 2022. p. 1-20 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13242 LNCS).

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

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

PY - 2022/1/1

Y1 - 2022/1/1

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

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

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 - https://doi.org/10.1007/978-3-030-99253-8_1

DO - https://doi.org/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 - 25th International Conference, FOSSACS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Proceedings

A2 - Bouyer, Patricia

A2 - Schröder, Lutz

PB - Springer Science and Business Media Deutschland GmbH

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 -

Angluin D, Antonopoulos T, Fisman D, George N. Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata. In Bouyer P, Schröder L, editors, Foundations of Software Science and Computation Structures - 25th International Conference, FOSSACS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Proceedings. Springer Science and Business Media Deutschland GmbH. 2022. p. 1-20. (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-030-99253-8_1

Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata

Abstract

Publication series

Conference

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this