Results 251 to 260 of about 39,835 (307)
Some of the next articles are maybe not open access.
A grammar systems approach to natural language grammar
Linguistics and Philosophy, 2006Taking as its starting point significant similarities between a formal language model—Grammar Systems—and a grammatical theory—Autolexical Syntax—in this paper we suggest the application of the former to the topic of the latter. To show the applicability of Grammar Systems Theory to grammatical description, we introduce a formal-language-theoretic ...
M Dolores Jimenez Lopez
exaly +2 more sources
Cooperating Graph Grammar Systems. [PDF]
, 1999 In this paper the concept of cooperation is introduced into the context of graph grammars. Beside the definition of cooperating graph rewriting systems and beside some general comparisons between generated languages, the NLC and BNLC cooperating graph rewriting systems are studied in detail.
SIMEONI, Marta, Maria Staniszkis
openaire +2 more sources
Fairness in grammar systems [PDF]
Acta Cybern., 1996 A grammar system is a construct consisting of several usual grammars, working together, in a specified way, for generating a language. If the grammars work together on the same sentential form, then the system is called cooperating/distributed (CD for short) grammar system. The paper concerns CD grammar systems. Intuitively, such systems and their work
Jürgen Dassow, Victor Mitrana
openaire +4 more sources
Parallel communicating grammar systems with bounded resources [PDF]
Theoretical Computer Science, 2002 In this paper we study size properties of context-free returning parallel communicating grammar systems (PC grammar systems). We show that for each context-free returning PC grammar system an equivalent system of this type can be constructed, where the ...
György Vaszil
exaly +2 more sources
Accepting Grammars and Systems via Context Condition Grammars
J. Autom. Lang. Comb., 1996We investigate several kinds of regulated rewriting (matrix, ordered, programmed, and variants thereof) and of parallel rewriting mechanisms (Lindenmayer systems, uniformly limited Lindenmayer systems, limited Lindenmayer systems and scattered context grammars) as accepting devices, in contrast with the usual generating mode.
Henning Bordihn, Henning Fernau
openaire +2 more sources
1978
A new language generating mechanism is defined. It is derived from a generalization of the two-level substitution mechanism and involves several (incomplete) grammars which communicate with each other by introducing variables for which they have no productions themselves. When the grammars are context-free, this yields an alternative definition for the
Robert Meersman, Grzegorz Rozenberg
openaire +1 more source
A new language generating mechanism is defined. It is derived from a generalization of the two-level substitution mechanism and involves several (incomplete) grammars which communicate with each other by introducing variables for which they have no productions themselves. When the grammars are context-free, this yields an alternative definition for the
Robert Meersman, Grzegorz Rozenberg
openaire +1 more source
Fundamenta Informaticae, 1995
We introduce two new grammatical interpretations which enlarge the grammatical collection of a given grammar. Briefly, the relations between these interpretations are presented, and also the effect on the generative capacity of a grammar system of the demand that all its components are similar to a given grammar.
openaire +2 more sources
We introduce two new grammatical interpretations which enlarge the grammatical collection of a given grammar. Briefly, the relations between these interpretations are presented, and also the effect on the generative capacity of a grammar system of the demand that all its components are similar to a given grammar.
openaire +2 more sources
J. Autom. Lang. Comb., 2000
The idea of co-operating agents has been incorporated in the theory of formal languages by introducing co-operating distributed grammar systems, where the different grammar components of the system do their work according to given start and stop conditions.
openaire +2 more sources
The idea of co-operating agents has been incorporated in the theory of formal languages by introducing co-operating distributed grammar systems, where the different grammar components of the system do their work according to given start and stop conditions.
openaire +2 more sources
International Journal of Man-Machine Studies, 1977
A formalism PSGL for writing natural language grammars has been developed, along with a computer system for interpreting it and parsing sentences. PSGL combines ideas from augmented transition network theory, systemic grammar, and Chomsky's recent trace theory, in a way that allows one to write compact and linguistically apt grammars.
openaire +1 more source
A formalism PSGL for writing natural language grammars has been developed, along with a computer system for interpreting it and parsing sentences. PSGL combines ideas from augmented transition network theory, systemic grammar, and Chomsky's recent trace theory, in a way that allows one to write compact and linguistically apt grammars.
openaire +1 more source
Grammars, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources