Add to ORKGInformation Processing Letters 41, 233-238, 1992We show that a P-complete language can be described by using the shuffle operator, shufle closure, union, concatenation, Kleene star and intersection on a finite alphabet
International audienceThere is an increasing interest in the shuffle product on formal languages, ma...
International audienceThere is an increasing interest in the shuffle product on formal languages, ma...
International audienceThere is an increasing interest in the shuffle product on formal languages, ma...
AbstractIn this paper we show that shuffle languages are contained in one-way-NSPACE(logn) thus in P...
AbstractIt is shown that every finite expression which uses the operations union, product, Kleene st...
AbstractIt is demonstrated that the following problems are NP complete: 1.(1) Given words w and w1, ...
AbstractWe investigate a special variant of the shuffle decomposition problem for regular languages;...
Shuffle operation on trajectories is useful in modeling parallel composition of wordsand languages. ...
AbstractIt is shown that every finite expression which uses the operations union, product, Kleene st...
AbstractWe introduce and study the notion of shuffle residual of a language L: the set containing th...
There is an increasing interest in the shuffle product on formal languages, mainly because it is a s...
There is an increasing interest in the shuffle product on formal languages, mainly because it is a s...
Motivated by the general problem to characterize families of languages closed under shuffle, we inve...
AbstractThere is an increasing interest in the shuffle product on formal languages, mainly because i...
Motivated by the general problem to characterize families of languages closed under shuffle, we inve...
International audienceThere is an increasing interest in the shuffle product on formal languages, ma...
International audienceThere is an increasing interest in the shuffle product on formal languages, ma...
International audienceThere is an increasing interest in the shuffle product on formal languages, ma...
AbstractIn this paper we show that shuffle languages are contained in one-way-NSPACE(logn) thus in P...
AbstractIt is shown that every finite expression which uses the operations union, product, Kleene st...
AbstractIt is demonstrated that the following problems are NP complete: 1.(1) Given words w and w1, ...
AbstractWe investigate a special variant of the shuffle decomposition problem for regular languages;...
Shuffle operation on trajectories is useful in modeling parallel composition of wordsand languages. ...
AbstractIt is shown that every finite expression which uses the operations union, product, Kleene st...
AbstractWe introduce and study the notion of shuffle residual of a language L: the set containing th...
There is an increasing interest in the shuffle product on formal languages, mainly because it is a s...
There is an increasing interest in the shuffle product on formal languages, mainly because it is a s...
Motivated by the general problem to characterize families of languages closed under shuffle, we inve...
AbstractThere is an increasing interest in the shuffle product on formal languages, mainly because i...
Motivated by the general problem to characterize families of languages closed under shuffle, we inve...
International audienceThere is an increasing interest in the shuffle product on formal languages, ma...
International audienceThere is an increasing interest in the shuffle product on formal languages, ma...
International audienceThere is an increasing interest in the shuffle product on formal languages, ma...