Decision trees for regular factorial languages

In this paper, we study arbitrary regular factorial languages over a finite alphabet Σ. For the set of words L(n)of the length n belonging to a regular factorial language L, we investigate the depth of decision trees solving the recognition and the membership problems deterministically and nondeterm...

Full description

Bibliographic Details
Main Author: Mikhail Moshkov
Format: Article
Language:English
Published: Elsevier 2022-09-01
Series:Array
Subjects:
Online Access:http://www.sciencedirect.com/science/article/pii/S2590005622000510