Page Index - RenukaBhovi/Formal-Languages-and-Automata-Theory GitHub Wiki 4 page(s) in this GitHub Wiki: Home Formal Languages and Automata Theory Show that √3 is irrational Define an operation third on strings and language as third(a1a2a3a4a5a6 ...) = a3a6 ... with the appropriate extension of this definition to languages. Prove the closure of the family of regular languages under this operation.