APA aipamena

Pin, J. (2020). How to Prove that a Language Is Regular or Star-Free? Language and Automata Theory and Applications.

Chicago Style aipamena

Pin, Jean-Éric. "How to Prove That a Language Is Regular or Star-Free?" Language and Automata Theory and Applications 2020.

MLA aipamena

Pin, Jean-Éric. "How to Prove That a Language Is Regular or Star-Free?" Language and Automata Theory and Applications 2020.

Kontuz: berrikusi erreferentzia hauek erabili aurretik.