Παραπομπή APA

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

Παραπομπή Chicago Style

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

Παραπομπή MLA

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

Πρόσοχή: Οι παραπομπές μπορεί να μην είναι 100% ακριβείς.