Representing regular languages of infinite words using mod 2 multiplicity automata

DOI10.1007/978-3-030-99253-8_1OpenAlexW4226017521MaRDI QIDQ6141755

Timos Antonopoulos, Dana Angluin, Nevin George, Dana Fisman

Publication date: 23 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-99253-8_1

zbMATH Keywords

Büchi automatalinear temporal logicmultiplicity automataconcisenessregular omega languages

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Cites Work

• Learning regular omega languages
• Unambiguous Büchi automata.
• Weighted automata are compact and actively learnable
• \( \omega \)-automata
• Coinductive algorithms for Büchi automata
• Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata
• Learning functions represented as multiplicity automata
• Learning Behaviors of Automata from Multiplicity and Equivalence Queries
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Representing regular languages of infinite words using mod 2 multiplicity automata