Cargando…
How to Prove that a Language Is Regular or Star-Free?
This survey article presents some standard and less standard methods used to prove that a language is regular or star-free.
| Autor principal: | |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
2020
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7206632/ http://dx.doi.org/10.1007/978-3-030-40608-0_5 |