Decision Trees for Binary Subword-Closed Languages

Decision Trees for Binary Subword-Closed Languages

In this paper, we study arbitrary subword-closed languages over the alphabet <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo>{</mo><mn>0</mn><mo>,</mo><mn>1<...

Full description

Bibliographic Details
Main Author: Mikhail Moshkov
Format: Article
Language:English
Published: MDPI AG 2023-02-01
Series:Entropy
Subjects:
subword-closed language
recognition problem
membership problem
deterministic decision tree
nondeterministic decision tree
Online Access:https://www.mdpi.com/1099-4300/25/2/349

Internet

https://www.mdpi.com/1099-4300/25/2/349

Similar Items