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 |
| _version_ | 1783530447387492352 |
|---|---|
| author | Pin, Jean-Éric |
| author_facet | Pin, Jean-Éric |
| author_sort | Pin, Jean-Éric |
| collection | PubMed |
| description | This survey article presents some standard and less standard methods used to prove that a language is regular or star-free. |
| format | Online Article Text |
| id | pubmed-7206632 |
| institution | National Center for Biotechnology Information |
| language | English |
| publishDate | 2020 |
| record_format | MEDLINE/PubMed |
| spelling | pubmed-72066322020-05-08 How to Prove that a Language Is Regular or Star-Free? Pin, Jean-Éric Language and Automata Theory and Applications Article This survey article presents some standard and less standard methods used to prove that a language is regular or star-free. 2020-01-07 /pmc/articles/PMC7206632/ http://dx.doi.org/10.1007/978-3-030-40608-0_5 Text en © Springer Nature Switzerland AG 2020 This article is made available via the PMC Open Access Subset for unrestricted research re-use and secondary analysis in any form or by any means with acknowledgement of the original source. These permissions are granted for the duration of the World Health Organization (WHO) declaration of COVID-19 as a global pandemic. |
| spellingShingle | Article Pin, Jean-Éric How to Prove that a Language Is Regular or Star-Free? |
| title | How to Prove that a Language Is Regular or Star-Free? |
| title_full | How to Prove that a Language Is Regular or Star-Free? |
| title_fullStr | How to Prove that a Language Is Regular or Star-Free? |
| title_full_unstemmed | How to Prove that a Language Is Regular or Star-Free? |
| title_short | How to Prove that a Language Is Regular or Star-Free? |
| title_sort | how to prove that a language is regular or star-free? |
| topic | Article |
| url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7206632/ http://dx.doi.org/10.1007/978-3-030-40608-0_5 |
| work_keys_str_mv | AT pinjeaneric howtoprovethatalanguageisregularorstarfree |