Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,273,813 papers from all fields of science
Search
Sign In
Create Free Account
Context-free language
Known as:
CFL
, Context-free
, Context-free languages
Expand
In formal language theory, a context-free language (CFL) is a language generated by some context-free grammar (CFG). Different CF grammars can…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Abstract family of languages
Ambiguous grammar
Automata theory
CYK algorithm
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Unsupervised Learning of Visual Representations by Solving Jigsaw Puzzles
M. Noroozi
,
P. Favaro
European Conference on Computer Vision
2016
Corpus ID: 187547
We propose a novel unsupervised learning approach to build features suitable for object detection and classification. The…
Expand
Highly Cited
2008
Highly Cited
2008
Principles of model checking
C. Baier
,
J. Katoen
2008
Corpus ID: 5302889
Our growing dependence on increasingly complex computer and software systems necessitates the development of formalisms…
Expand
Review
2007
Review
2007
Multiple Context-Free Grammars
Daniel Götzmann
2007
Corpus ID: 17598576
. Multiple context-free grammar (MCFG) is a weakly context-sensitive grammar formalism that deals with tuples of strings. An MCFG…
Expand
Highly Cited
2006
Highly Cited
2006
The Essential Impact of Context on Organizational Behavior
G. Johns
2006
Corpus ID: 11243056
I argue that the impact of context on organizational behavior is not sufficiently recognized or appreciated by researchers. I…
Expand
Highly Cited
2003
Highly Cited
2003
Selecting next speaker: The context-sensitive operation of a context-free organization
Gene H. Lerner
Language in society
2003
Corpus ID: 145481359
This report extends earlier context-free treatments of turn-taking for conversation by describing the context-sensitive operation…
Expand
Highly Cited
1997
Highly Cited
1997
Context-Free Languages and Pushdown Automata
Jean-Michel Autebert
,
J. Berstel
,
L. Boasson
Handbook of Formal Languages
1997
Corpus ID: 1974181
This chapter is devoted to context-free languages. Context-free languages and grammars were designed initially to formalize…
Expand
Highly Cited
1970
Highly Cited
1970
An efficient context-free parsing algorithm
J. Earley
Communications of the ACM
1970
Corpus ID: 35664
A parsing algorithm which seems to be the most efficient general context-free algorithm known is described. It is similar to both…
Expand
Highly Cited
1968
Highly Cited
1968
Semantics of context-free languages
D. Knuth
Mathematical Systems Theory
1968
Corpus ID: 5182310
Abstract“Meaning” may be assigned to a string in a context-free language by defining “attributes” of the symbols in a derivation…
Expand
Highly Cited
1968
Highly Cited
1968
Indexed Grammars—An Extension of Context-Free Grammars
A. Aho
Journal of the ACM
1968
Corpus ID: 9539666
A new type of grammar for generating formal languages, called an indexed grammar, is presented. An indexed grammar is an…
Expand
Highly Cited
1966
Highly Cited
1966
The mathematical theory of context free languages
S. Ginsburg
1966
Corpus ID: 61616162
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE