AbstractUsing original arguments about sets of integers satisfying some first-order formula of the Presburger arithmetic 〈N,+〉, we give a new proof that the commutative closure of a slip-language over a two letters alphabet is context-free
AbstractLet A be a finite alphabet and A∗ the free monoid generated by A. A language is any subset o...
AbstractThe operation of nested iterated substitution preserves languages with the semilinear proper...
The POL be the class of polynomials having nonnegative integer coefficients and EXP the class of exp...
Using original arguments about sets of integers satisfying some first-order formula of the Presburge...
AbstractLet Σ = {a1, a2, …, an} be an alphabet and let L ⊂ Σ∗ be the commutative image of FP∗ where ...
A sufficient condition is given in order for the set of those words, which are obtained by permuting...
We prove the inherent ambiguity of certain context-free languages, the prototype of which is L={s2t|...
AbstractIt is shown that the problem whether an effectively given deterministic ω-context-free langu...
The thesis presents results obtained during the authors PhD-studies. First systems of language equat...
AbstractA strengthened form of the pumping lemma for context-free languages is used to give a simple...
AbstractLet M be a class of automata (in a precise sense to be defined) and Mc the class obtained by...
The problem of the commutative equivalence of context-free and regular languages is studied. Conditi...
International audienceA set of integers is $S$-recognizable in an abstract numeration system $S$ if ...
By a reduction to Post's Correspondence Problem we provide a direct proof of the known fact that the...
© 2016 Discrete Mathematics and Theoretical Computer Science (DMTCS), Nancy, France. For a language ...
AbstractLet A be a finite alphabet and A∗ the free monoid generated by A. A language is any subset o...
AbstractThe operation of nested iterated substitution preserves languages with the semilinear proper...
The POL be the class of polynomials having nonnegative integer coefficients and EXP the class of exp...
Using original arguments about sets of integers satisfying some first-order formula of the Presburge...
AbstractLet Σ = {a1, a2, …, an} be an alphabet and let L ⊂ Σ∗ be the commutative image of FP∗ where ...
A sufficient condition is given in order for the set of those words, which are obtained by permuting...
We prove the inherent ambiguity of certain context-free languages, the prototype of which is L={s2t|...
AbstractIt is shown that the problem whether an effectively given deterministic ω-context-free langu...
The thesis presents results obtained during the authors PhD-studies. First systems of language equat...
AbstractA strengthened form of the pumping lemma for context-free languages is used to give a simple...
AbstractLet M be a class of automata (in a precise sense to be defined) and Mc the class obtained by...
The problem of the commutative equivalence of context-free and regular languages is studied. Conditi...
International audienceA set of integers is $S$-recognizable in an abstract numeration system $S$ if ...
By a reduction to Post's Correspondence Problem we provide a direct proof of the known fact that the...
© 2016 Discrete Mathematics and Theoretical Computer Science (DMTCS), Nancy, France. For a language ...
AbstractLet A be a finite alphabet and A∗ the free monoid generated by A. A language is any subset o...
AbstractThe operation of nested iterated substitution preserves languages with the semilinear proper...
The POL be the class of polynomials having nonnegative integer coefficients and EXP the class of exp...
DOI
Add to ORKG