Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata

Dana Angluin, Timos Antonopoulos, Dana Fisman, Nevin George

Ben-Gurion University of the Negev

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

Fingerprint

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

Mathematics

Engineering & Materials Science