It has been pointed out that context-free grammars of a certain class have the property that a one-one mapping exists between the structural descriptions of its sentences and the sentences generated by a finite state grammar. Given a grammar, it is decidable whether it belongs to this specific class or not.The grammars of this class can be divided into a countable hierarchy of increasing complexity
One of the difficulties in the analysis of context-free grammars (and therefore languages) is the st...
We define a generalization of the finite state acceptors for derivation structures and for phrase st...
AbstractIn this paper the investigation of the theory of grammatical complexity as started by Bucher...
It has been pointed out that context-free grammars of a certain class have the property that a one-o...
A grammar can be regarded as a device that enumerates the sentences of a language. We study a sequen...
We describe the use of finite state automata for the description of natural languages. We demonstrat...
Contains reports on one research project.National Science FoundationEastman Kodak Company (Grant
It is proved that every grammar for a bounded, context-free language has finite index
A hierarchy of context-free grammars and languages with respect to the index of context-free grammar...
This dissertation is a theoretical study of finite-state based grammars used in natural language pro...
This paper investigates generative grammars with only one type of symbol: no distinction is made bet...
A finite state language is a finite or infinite set of strings (sentences) of symbols (words) genera...
Our programme is to use the model of W. Woods 1970 to attempt a full scale analysis of the language....
In the study of collocations and of frozen sentences (idioms, clichés, collocations, many metaphors ...
Four of the criteria of complexity of the description of context-free languages by context-free gram...
One of the difficulties in the analysis of context-free grammars (and therefore languages) is the st...
We define a generalization of the finite state acceptors for derivation structures and for phrase st...
AbstractIn this paper the investigation of the theory of grammatical complexity as started by Bucher...
It has been pointed out that context-free grammars of a certain class have the property that a one-o...
A grammar can be regarded as a device that enumerates the sentences of a language. We study a sequen...
We describe the use of finite state automata for the description of natural languages. We demonstrat...
Contains reports on one research project.National Science FoundationEastman Kodak Company (Grant
It is proved that every grammar for a bounded, context-free language has finite index
A hierarchy of context-free grammars and languages with respect to the index of context-free grammar...
This dissertation is a theoretical study of finite-state based grammars used in natural language pro...
This paper investigates generative grammars with only one type of symbol: no distinction is made bet...
A finite state language is a finite or infinite set of strings (sentences) of symbols (words) genera...
Our programme is to use the model of W. Woods 1970 to attempt a full scale analysis of the language....
In the study of collocations and of frozen sentences (idioms, clichés, collocations, many metaphors ...
Four of the criteria of complexity of the description of context-free languages by context-free gram...
One of the difficulties in the analysis of context-free grammars (and therefore languages) is the st...
We define a generalization of the finite state acceptors for derivation structures and for phrase st...
AbstractIn this paper the investigation of the theory of grammatical complexity as started by Bucher...
DOI
Add to ORKG