Deciding Atomicity of Subword-Closed Languages

Atminas, Aistis; Lozin, Vadim

doi:10.1007/978-3-031-05578-2_5

Cited by 2 publications

(5 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, to the right of a i , there are only 0s. Thus, w = w 1 0 n−i , where |w 1 | = i ≤ 2m, i.e., w can be represented in the form (1).…”

Section: Proofs Of Theorems 1 Andmentioning

confidence: 99%

“…Let j = i + 1. Then, w = 0 i 1 n−i , i.e., w can be represented in the form (1). Let now j < i. Denote w 2 = a j • • • a i .…”

Section: Proofs Of Theorems 1 Andmentioning

confidence: 99%

“…The word w has at most m 0s to the right of a j and at most m 1s to the left of a i . Therefore, |w 2 | ≤ 2m and w = 0 j−1 w 2 1 n−i , i.e., w can be represented in the form (1).…”

Section: Proofs Of Theorems 1 Andmentioning

confidence: 99%

“…We can prove in a similar way that |w 2 | ≤ 2m and |w 3 | ≤ 2m. Therefore, w can be represented in the form (1).…”

Section: Proofs Of Theorems 1 Andmentioning

confidence: 99%

“…In this paper, we study arbitrary binary languages (languages over the alphabet E = {0, 1}) that are subword closed: if a word w 1 u 1 w 2 • • • w m u m w m+1 belongs to a language, then the word u 1 • • • u m belongs to this language. Subword-closed languages have attracted the attention of researchers in the field of formal languages for many years [1][2][3][4][5].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Decision Trees for Binary Subword-Closed Languages

Moshkov

2023

Entropy

View full text Add to dashboard Cite

In this paper, we study arbitrary subword-closed languages over the alphabet {0,1} (binary subword-closed languages). For the set of words L(n) of the length n belonging to a binary subword-closed language L, we investigate the depth of the decision trees solving the recognition and the membership problems deterministically and nondeterministically. In the case of the recognition problem, for a given word from L(n), we should recognize it using queries, each of which, for some i∈{1,…,n}, returns the ith letter of the word. In the case of the membership problem, for a given word over the alphabet {0,1} of the length n, we should recognize if it belongs to the set L(n) using the same queries. With the growth of n, the minimum depth of the 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 types of trees and problems (decision trees solving the problem of recognition nondeterministically and decision trees solving the membership problem deterministically and nondeterministically), with the growth of n, the minimum depth of the decision trees is either bounded from above by a constant or grows linearly. We study the joint behavior of the minimum depths of the considered four types of decision trees and describe five complexity classes of binary subword-closed languages.

show abstract

“…Moreover, to the right of a i , there are only 0s. Thus, w = w 1 0 n−i , where |w 1 | = i ≤ 2m, i.e., w can be represented in the form (1).…”

Section: Proofs Of Theorems 1 Andmentioning

confidence: 99%

“…Let j = i + 1. Then, w = 0 i 1 n−i , i.e., w can be represented in the form (1). Let now j < i. Denote w 2 = a j • • • a i .…”

Section: Proofs Of Theorems 1 Andmentioning

confidence: 99%

“…The word w has at most m 0s to the right of a j and at most m 1s to the left of a i . Therefore, |w 2 | ≤ 2m and w = 0 j−1 w 2 1 n−i , i.e., w can be represented in the form (1).…”

Section: Proofs Of Theorems 1 Andmentioning

confidence: 99%

“…We can prove in a similar way that |w 2 | ≤ 2m and |w 3 | ≤ 2m. Therefore, w can be represented in the form (1).…”

Section: Proofs Of Theorems 1 Andmentioning

confidence: 99%