Show simple item record

dc.contributor.authorMoshkov, Mikhail
dc.date.accessioned2022-01-11T13:28:52Z
dc.date.available2022-01-11T13:28:52Z
dc.date.issued2022-01-06
dc.identifier.urihttp://hdl.handle.net/10754/674913
dc.description.abstractIn this paper, we study arbitrary regular factorial languages over a finite alphabet $\Sigma$. 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 nondeterministically. In the case of recognition problem, for a given word from $L(n)$, we should recognize it using queries each of which, for some $ i\in \{1,\ldots ,n\}$, returns the $i$th letter of the word. In the case of membership problem, for a given word over the alphabet $\Sigma$ of the length $n$, we should recognize if it belongs to the set $L(n)$ using the same queries. For a given problem and type of trees, instead of the minimum depth $h(n)$ of a decision tree of the considered type solving the problem for $L(n)$, we study the smoothed minimum depth $H(n)=\max\{h(m):m\le n\}$. With the growth of $n$, the smoothed minimum depth of decision trees solving the problem of recognition deterministically is either bounded from above by a constant, or grows as a logarithm, or linearly. For other cases (decision trees solving the problem of recognition nondeterministically, and decision trees solving the membership problem deterministically and nondeterministically), with the growth of $n$, the smoothed minimum depth of decision trees is either bounded from above by a constant or grows linearly. As corollaries of the obtained results, we study joint behavior of smoothed minimum depths of decision trees for the considered four cases and describe five complexity classes of regular factorial languages. We also investigate the class of regular factorial languages over the alphabet $\{0,1\}$ each of which is given by one forbidden word.
dc.description.sponsorshipResearch reported in this publication was supported by King Abdullah University of Science and Technology (KAUST)
dc.publisherarXiv
dc.relation.urlhttps://arxiv.org/pdf/2201.01952.pdf
dc.rightsArchived with thanks to arXiv
dc.subjectregular factorial language
dc.subjectrecognition problem
dc.subjectmembership problem
dc.subjectdeterministic decision tree
dc.subjectnondeterministic decision tree
dc.titleDecision trees for regular factorial languages
dc.typePreprint
dc.contributor.departmentApplied Mathematics and Computational Science Program
dc.contributor.departmentComputer, Electrical and Mathematical Science and Engineering (CEMSE) Division
dc.eprint.versionPre-print
dc.identifier.arxivid2201.01952
kaust.personMoshkov, Mikhail
refterms.dateFOA2022-01-11T13:29:50Z


Files in this item

Thumbnail
Name:
Preprintfile1.pdf
Size:
1.260Mb
Format:
PDF
Description:
Pre-print

This item appears in the following Collection(s)

Show simple item record