Decision Trees for Binary Subword-Closed Languages

In this paper, we study arbitrary subword-closed languages over the alphabet [Formula: see text] (binary subword-closed languages). For the set of words [Formula: see text] of the length n belonging to a binary subword-closed language L, we investigate the depth of the decision trees solving the rec...

Descripción completa

Detalles Bibliográficos
Autor principal: Moshkov, Mikhail
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2023
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9955005/
https://www.ncbi.nlm.nih.gov/pubmed/36832715
http://dx.doi.org/10.3390/e25020349

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9955005/
https://www.ncbi.nlm.nih.gov/pubmed/36832715
http://dx.doi.org/10.3390/e25020349

Ejemplares similares