How to Prove that a Language Is Regular or Star-Free?

Jean-Eric Pin (1)

1 IRIF (UMR_8243) - Institut de Recherche en Informatique Fondamentale

This survey article presents some standard and less standard methods used to prove that a language is regular or star-free.

Domaines: Théorie et langage formel [cs.FL]

Jean-Eric Pin. How to Prove that a Language Is Regular or Star-Free?. Proceedings LATA 2020, Lecture Notes in Computer Science 12038 (2020), pp.68-88, 2020, ⟨10.1007/978-3-030-40608-0_5⟩. ⟨hal-02949627⟩