Skip to search formSkip to main contentSkip to account menu

Context-free language

Known as: CFL, Context-free, Context-free languages 
In formal language theory, a context-free language (CFL) is a language generated by some context-free grammar (CFG). Different CF grammars can… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Abstract family of languagesAmbiguous grammarAutomata theoryCYK algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Complete suboptimal folding of RNA and the stability of secondary structures , Biopolymers
Highly Cited
2010
Highly Cited
2010
Semantic clustering of XML documents
Dealing with structure and content semantics underlying semistructured documents is challenging for any task of document… 
Highly Cited
2001
Highly Cited
2001
Recognizing Multitasked Activities using Stochastic Context-Free Grammar
In this paper, we present techniques for characterizing complex, multi-tasked activities that require both exemplars and models… 
Highly Cited
1998
Highly Cited
1998
Clonal Mosaic Model for the Synthesis of Mammalian Coat Patterns
We introduce the Clonal Mosaic (CM) model for the synthesis of mammalian coat patterns, present its implementation for modeling… 
Highly Cited
1990
Highly Cited
1990
Certainty Grid Representation for Robot Navigation by a Bayesian Method
Summary Recent development of sensor knowledge representation by the use of a certainty grid has been extensive and shown the… 
Highly Cited
1989
Highly Cited
1989
The Lincoln robust continuous speech recognizer
The Lincoln stress-resistant HMM (hidden Markov model) CSR has been extended to large-vocabulary continuous speech for both… 
Highly Cited
1988
Highly Cited
1988
Parsing Incomplete Sentences
An efficient context-free parsing algorithm is presented that can parse sentences with unknown parts of unknown length. It… 
1986
1986
On context-free sets of graphs and their monadic second-order theory
  • B. Courcelle
  • Graph-Grammars and Their Application to Computer…
  • 1986
  • Corpus ID: 13314079
The algebraic framework for studying graphs yields a notion of system of equations defining equational sets of graphs. Context… 
1976
1976
An application of stochastic languages to fingerprint pattern recognition
Highly Cited
1971
Highly Cited
1971
Pair Grammars, Graph Languages and String-to-Graph Translations
  • T. W. Pratt
  • Journal of computer and system sciences (Print)
  • 1971
  • Corpus ID: 205894879
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)