Explicit constructions are given to illustrate the loss of control that ensues when one replaces the regular languages of automatic group theory with larger families of languages. © World Scientific Publishing Company
This paper corrects the characterisation of biautomatic groups presented in Lemma 2.5.5 in the book ...
Current theories of grammar handle both extraction and anaphorization by introducing variables into ...
Over the quarter century, it is gratifying to note that the significance of regulated or controlled ...
. A group is combable if it can be represented by a language of words satisfying a fellow traveller ...
A new construction of combings is used to distinguish between several previously indistinguishable c...
Abstract. A new construction of combings is used to distinguish between several previously indisting...
In the last several years a remarkable interplay between geometry, group theory, and the theory of f...
Abstract. Accessible groups whose word problems are accepted by a deterministic nested stack automat...
• Use subword reversing to constructing examples of ordered groups. • Subword Reversing is a combina...
Combettes Bernard. Groupes syntaxiques et fonctions : problèmes de définition des notions grammatica...
One of the difficulties in the analysis of context-free grammars (and therefore languages) is the st...
A Pumping Lemma Scheme for the Control Language Hierarchy In [9] Weir introduced control grammars as...
How do the algebraic regularities in natural language, described by generative grammar, emerge? One ...
The notable exclusions from the family of automatic groups are those nilpotent groups which are not ...
Proceedings of the Fourteenth Annual Meeting of the Berkeley Linguistics Society (1988), pp. 35-5
This paper corrects the characterisation of biautomatic groups presented in Lemma 2.5.5 in the book ...
Current theories of grammar handle both extraction and anaphorization by introducing variables into ...
Over the quarter century, it is gratifying to note that the significance of regulated or controlled ...
. A group is combable if it can be represented by a language of words satisfying a fellow traveller ...
A new construction of combings is used to distinguish between several previously indistinguishable c...
Abstract. A new construction of combings is used to distinguish between several previously indisting...
In the last several years a remarkable interplay between geometry, group theory, and the theory of f...
Abstract. Accessible groups whose word problems are accepted by a deterministic nested stack automat...
• Use subword reversing to constructing examples of ordered groups. • Subword Reversing is a combina...
Combettes Bernard. Groupes syntaxiques et fonctions : problèmes de définition des notions grammatica...
One of the difficulties in the analysis of context-free grammars (and therefore languages) is the st...
A Pumping Lemma Scheme for the Control Language Hierarchy In [9] Weir introduced control grammars as...
How do the algebraic regularities in natural language, described by generative grammar, emerge? One ...
The notable exclusions from the family of automatic groups are those nilpotent groups which are not ...
Proceedings of the Fourteenth Annual Meeting of the Berkeley Linguistics Society (1988), pp. 35-5
This paper corrects the characterisation of biautomatic groups presented in Lemma 2.5.5 in the book ...
Current theories of grammar handle both extraction and anaphorization by introducing variables into ...
Over the quarter century, it is gratifying to note that the significance of regulated or controlled ...
DOI
Add to ORKG