Motivated by the studies done by G. Siromoney et al. (1973) and Alexan- dru Mateescu et al. (1998) we examine the language theoretic results related to shuf- fle on trajectories by making use of Siromoney array grammars such as (R : R)AG, (R : C F )AG, (C F : R)AG, (C F : C F )AG, (C S : R)AG, (C S : C S)AG and (C F : C S)AG which are more powerful than the Siromoney matrix grammars (1972) and are used to make digital pictures
In this paper, we extend a newly introduced concept called the jumping nite automata for accepting ...
James et al. have introduced a variant of P systems called parallel contextual array insertion delet...
It is shown that regular control on regular and linear kolam array grammars does not increase their ...
Generative models of picture languages with array rewriting rules are presented. The rewriting rules...
A simple and effective syntactic method of description of picture patterns of rectangular arrays of ...
AbstractWe investigate the use of shuffle on trajectories to model certain classes of languages aris...
International audienceWe investigate the computational power of d-dimensional contextual array gramm...
There exist very lucid explanations of the combinatorial origins of rational and algebraic functi...
The language of an array grammar has been defined as the set of finite, connected terminal arrays, s...
A collection of articles by leading experts in theoretical computer science, this volume commemorate...
In this paper, we introduce a new concept of trajectory array P system which consists of a membrane ...
Shuffle on trajectories was introduced by Mateescu et al. [147] as a method of generalizing sev-eral...
We consider various shuffling and unshuffling operations on languages and words, and examine their c...
We consider generative mechanisms producing languages by starting from a finite set of words and shu...
Finite-state two-dimensional languages are much less well-behaved than their one-dimensional counter...
In this paper, we extend a newly introduced concept called the jumping nite automata for accepting ...
James et al. have introduced a variant of P systems called parallel contextual array insertion delet...
It is shown that regular control on regular and linear kolam array grammars does not increase their ...
Generative models of picture languages with array rewriting rules are presented. The rewriting rules...
A simple and effective syntactic method of description of picture patterns of rectangular arrays of ...
AbstractWe investigate the use of shuffle on trajectories to model certain classes of languages aris...
International audienceWe investigate the computational power of d-dimensional contextual array gramm...
There exist very lucid explanations of the combinatorial origins of rational and algebraic functi...
The language of an array grammar has been defined as the set of finite, connected terminal arrays, s...
A collection of articles by leading experts in theoretical computer science, this volume commemorate...
In this paper, we introduce a new concept of trajectory array P system which consists of a membrane ...
Shuffle on trajectories was introduced by Mateescu et al. [147] as a method of generalizing sev-eral...
We consider various shuffling and unshuffling operations on languages and words, and examine their c...
We consider generative mechanisms producing languages by starting from a finite set of words and shu...
Finite-state two-dimensional languages are much less well-behaved than their one-dimensional counter...
In this paper, we extend a newly introduced concept called the jumping nite automata for accepting ...
James et al. have introduced a variant of P systems called parallel contextual array insertion delet...
It is shown that regular control on regular and linear kolam array grammars does not increase their ...