How to Prove that a Language Is Regular or Star-Free? - Archive ouverte HAL
Book Sections Year : 2020

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

Jean-Eric Pin
Institut de Recherche en Informatique Fondamentale

Abstract

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

Domains

Formal Languages and Automata Theory [cs.FL]
Fichier principal
Vignette du fichier
LATA2020Web.pdf (340.14 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Jean-Eric Pin  : Connect in order to contact the contributor

https://hal.science/hal-02949627

Submitted on : Friday, September 25, 2020-6:08:07 PM

Last modification on : Friday, May 17, 2024-4:10:02 PM

Long-term archiving on : Thursday, December 3, 2020-6:16:43 PM

Download

Dates and versions

hal-02949627 , version 1 (25-09-2020)

Identifiers

Cite

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS UP-SCIENCES ANR IRIF
38 View
1192 Download

Altmetric

Share

More