Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata.

Dana Angluin, Timos Antonopoulos, Dana Fisman, Nevin George

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 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.
Original languageAmerican English
Title of host publicationFoundations of Software Science and Computation Structures - FoSSaCS 2022
EditorsPatricia Bouyer, Lutz Schröder
Place of PublicationCham
PublisherSpringer
Pages1-20
Number of pages20
ISBN (Print)9783030992521
DOIs
StatePublished - 29 Mar 2022
Event25th 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 20226 Apr 2022

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume13242 LNCS

Conference

Conference25th 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/TerritoryGermany
CityMunich
Period4/04/226/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

Fingerprint

Dive into the research topics of 'Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata.'. Together they form a unique fingerprint.

Cite this