Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 220,307,307 papers from all fields of science

Search

Semantic Scholar uses AI to extract papers important to this topic.

2008

2008

With the introduction of constraints based on finite automata a new line of research has opened where constraints are based on…

Highly Cited

1997

Highly Cited

1997

Graph languages are sets of labeled graphs. They can be generated by graph grammars, and in particular by context-free graph…

Highly Cited

1995

Highly Cited

1995

The basic Schema Theorem for genetic algorithms is modified for a grammatically-based learning system. A context-free grammar is…

Highly Cited

1993

Highly Cited

1993

This dictionary of grammatical terms covers both current and traditional terminology in syntax and morphology. It includes…

1993

1993

Stochastic lexicalized context-free grammar (SLCFG) is an attractive compromise between the parsing efficiency of stochastic…

Highly Cited

1991

Highly Cited

1991

Summary. The concept of context-free grammar and of derivability in grammar are introduced. Moreover, the language (set of finite…

Highly Cited

1972

Highly Cited

1972

Topological characterizations of sets of graphs which can be generated by contextfree or linear grammars are given. It is shown…

Highly Cited

1972

Highly Cited

1972

A formal definition of one grammar "covering" another grammar is presented. I t is argued that this definition has the property…

Highly Cited

1971

Highly Cited

1967

Highly Cited

1967

The relationship between the set of productions of a context-free grammar and the corresponding set of defining equations is…