For any language L over an alphabet X, we define the root set, root(L) and the degree set, deg(L) as follows: (1) root(L) = where Q is the set of all primitive words over X, (2) deg(L) = . We deal with various decidability problems related to root and degree sets
Given a (finite or infinite) subset X of the free monoid A⁎ over a finite alphabet A, the rank of X ...
We consider several language-theoretic aspects of various notions of unique decipherability (or uniq...
International audienceDecidability of regularity preservation by a homomorphism is a well known open...
Abstract. In the algebraic theory of codes and formal languages, the set Q of all primitive words ov...
AbstractA word is primitive if it is not a proper power of a shorter word. We prove that the set Q o...
Primitive word is a word that can not be represented by any repetition of shorter words. Since every...
For those regular and context-free languages, which consist only of palindromic words, there exist f...
In the theory of automata and formal languages, the undecidability of various properties has been st...
The word problem of a finitely generated group is a fundamental notion in group theory; it can be de...
AbstractThe power of a language L is the set of all powers of the words in L. In this paper, the fol...
The separability problem for word languages of a class $\mathcal{C}$ bylanguages of a class $\mathca...
The first four chapters provide an introduction, background information and a summary of results fro...
Given a (finite or infinite) subset X of the free monoid A∗ over a finite alphabet A, the rank of X ...
It is proved that there exist context-free languages L1, L2, L3, and words w1, w2 such that it is re...
We survey decidable and undecidable satis ability problems for fragments of rstorder logic and be...
Given a (finite or infinite) subset X of the free monoid A⁎ over a finite alphabet A, the rank of X ...
We consider several language-theoretic aspects of various notions of unique decipherability (or uniq...
International audienceDecidability of regularity preservation by a homomorphism is a well known open...
Abstract. In the algebraic theory of codes and formal languages, the set Q of all primitive words ov...
AbstractA word is primitive if it is not a proper power of a shorter word. We prove that the set Q o...
Primitive word is a word that can not be represented by any repetition of shorter words. Since every...
For those regular and context-free languages, which consist only of palindromic words, there exist f...
In the theory of automata and formal languages, the undecidability of various properties has been st...
The word problem of a finitely generated group is a fundamental notion in group theory; it can be de...
AbstractThe power of a language L is the set of all powers of the words in L. In this paper, the fol...
The separability problem for word languages of a class $\mathcal{C}$ bylanguages of a class $\mathca...
The first four chapters provide an introduction, background information and a summary of results fro...
Given a (finite or infinite) subset X of the free monoid A∗ over a finite alphabet A, the rank of X ...
It is proved that there exist context-free languages L1, L2, L3, and words w1, w2 such that it is re...
We survey decidable and undecidable satis ability problems for fragments of rstorder logic and be...
Given a (finite or infinite) subset X of the free monoid A⁎ over a finite alphabet A, the rank of X ...
We consider several language-theoretic aspects of various notions of unique decipherability (or uniq...
International audienceDecidability of regularity preservation by a homomorphism is a well known open...
DOI
Add to ORKG