Angluin, Dana, Antonopoulos, Timos, Fisman, Dana, and George, Nevin. Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata. Retrieved from https://par.nsf.gov/biblio/10341269. Foundations of Software Science and Computation Structures . Web. doi:10.1007/978-3-030-99253-8\_1.
Angluin, Dana, Antonopoulos, Timos, Fisman, Dana, & George, Nevin. Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata. Foundations of Software Science and Computation Structures, (). Retrieved from https://par.nsf.gov/biblio/10341269. https://doi.org/10.1007/978-3-030-99253-8\_1
Angluin, Dana, Antonopoulos, Timos, Fisman, Dana, and George, Nevin.
"Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata". Foundations of Software Science and Computation Structures (). Country unknown/Code not available. https://doi.org/10.1007/978-3-030-99253-8\_1.https://par.nsf.gov/biblio/10341269.
@article{osti_10341269,
place = {Country unknown/Code not available},
title = {Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata},
url = {https://par.nsf.gov/biblio/10341269},
DOI = {10.1007/978-3-030-99253-8\_1},
abstractNote = {},
journal = {Foundations of Software Science and Computation Structures},
author = {Angluin, Dana and Antonopoulos, Timos and Fisman, Dana and George, Nevin},
}
Warning: Leaving National Science Foundation Website
You are now leaving the National Science Foundation website to go to a non-government website.
Website:
NSF takes no responsibility for and exercises no control over the views expressed or the accuracy of
the information contained on this site. Also be aware that NSF's privacy policy does not apply to this site.