Cargando…
Deciding Classes of Regular Languages: The Covering Approach
We investigate the membership problem that one may associate to every class of languages [Formula: see text]. The problem takes a regular language as input and asks whether it belongs to [Formula: see text]. In practice, finding an algorithm provides a deep insight on the class [Formula: see text]....
| Autor principal: | |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
2020
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7206641/ http://dx.doi.org/10.1007/978-3-030-40608-0_6 |