Computing grammars and context-sensitive languages

Along with network activations, the first experiments at deciphering the neuronal electrophysiological code underlying language are illustrated, in particular those recording the

rôle de vocabulaire auxiliaire, ses éléments intervenant seulement dans l’écriture des règles de production et en cours de dérivation; il pourra donc

It is obvious, that using a siurple scattered-context extension of CF languages, we obtain a grammar with interesting properties with respect to analysis of a

For non finite state languages, the set of congruence classes will be infinite, and thus we cannot have a finite fiducial set for the set of all strings in Sub(L), but we can have

2.1 Modeling the adaptation and monitoring of context-sensitive systems We propose that the specification of the adaptation and monitoring of context- sensitive systems

It appears that the problem of the syntactical parsing of the sentence and of the modeling of the skill of generating sentences from grammars is on its way to be solved: whether it is

In Section 3 we show that for regular languages there is a dichotomy between polynomial and exponential antichain growth, and give a polynomial-time algorithm for distinguishing the

The first one precisely recalls the definition of regular graphs (which are generated by deterministic graph grammars), it also presents rational graphs which