# Context-free language

## Papers overview

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

2011

2011

- Theor. Comput. Sci.
- 2011

We define context-free grammars with Büchi acceptance condition generating languages of countable words. We establish several… (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- IEEE Trans. Neural Networks
- 2001

Previous work on learning regular languages from exemplary training sequences showed that long short-term memory (LSTM… (More)

Is this relevant?

2000

2000

- GECCO
- 2000

Recurrent neural networks can represent and process simple context-free languages. However, the diiculty of nding with gradient… (More)

Is this relevant?

Highly Cited

1987

Highly Cited

1987

- PARLE
- 1987

A context-free grammar (CFG) in Greibach Normal Form coincides, in another notation, with a system of guarded recursion equations… (More)

Is this relevant?

Highly Cited

1983

Highly Cited

1983

- J. Comput. Syst. Sci.
- 1983

This is the first of a series of three papers describing some surprising connections between group theory, the theory of ends… (More)

Is this relevant?

1978

1978

- J. ACM
- 1978

The class of noncountlng (aperiodic) context-free parenthesis languages is introduced here and is found to extend the classical… (More)

Is this relevant?

Highly Cited

1972

Highly Cited

1972

- SIAM J. Comput.
- 1972

We assume three types of syntax errors can debase the sentences of a language generated by a context-free grammar: the… (More)

Is this relevant?

Highly Cited

1970

Highly Cited

1970

- Commun. ACM
- 1970

A parsing algorithm which seems to be the most efficient general context-free algorithm known is described. It is similar to both… (More)

Is this relevant?

Highly Cited

1968

Highly Cited

1968

- Mathematical systems theory
- 1968

“Meaning” may be assigned to a string in a context-free language by defining “attributes” of the symbols in a derivation tree for… (More)

Is this relevant?

Highly Cited

1966

Highly Cited

1966

- J. ACM
- 1966

In this report, certain properties of context-free (CF or type 2) grammars are investigated, like that of Chomsky. In particular… (More)

Is this relevant?