Results 1  10
of
1,251,923
The Set of Minimal Words of a Contextfree Language is Contextfree
, 1997
"... Let A be a finite, totally ordered alphabet, and let P be the lexicographic ordering on A*. Let X be a subset of A*. The language of minimal words of X is the subset of X composed of the lexicographically minimal word of X for each length: Min(X)=[x # X  \w # X, w=xOxPw]. The aim of this paper ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
is to prove that if L is a contextfree language, then the language Min(L) contextfree.
Semantics of ContextFree Languages
 In Mathematical Systems Theory
, 1968
"... "Meaning " may be assigned to a string in a contextfree language by defining "attributes " of the symbols in a derivation tree for that string. The attributes can be defined by functions associated with each production in the grammar. This paper examines the implications of th ..."
Abstract

Cited by 559 (0 self)
 Add to MetaCart
"Meaning " may be assigned to a string in a contextfree language by defining "attributes " of the symbols in a derivation tree for that string. The attributes can be defined by functions associated with each production in the grammar. This paper examines the implications
Statistical Parsing with a Contextfree Grammar and Word Statistics
, 1997
"... We describe a parsing system based upon a language model for English that is, in turn, based upon assigning probabilities to possible parses for a sentence. This model is used in a parsing system by finding the parse for the sentence with the highest probability. This system outperforms previou ..."
Abstract

Cited by 410 (18 self)
 Add to MetaCart
We describe a parsing system based upon a language model for English that is, in turn, based upon assigning probabilities to possible parses for a sentence. This model is used in a parsing system by finding the parse for the sentence with the highest probability. This system outperforms
On Strongly ContextFree Languages
, 2000
"... We investigate the contextfree languages whose complements are also contextfree. We call them strongly contextfree languages. The family of strongly linear languages is similarly defined. After examining the closure properties of the family of strongly contextfree languages, we prove that any sl ..."
Abstract
 Add to MetaCart
slender contextfree language is strongly linear. We then show that there are languages of a bounded complexity in terms of the number of nonterminals or productions necessary to generate them, whereas the complexity of their complements is arbitrarily large. Keywords: contextfree language, slender
On Lengths of Words in Contextfree Languages
 THEORETICAL COMPUTER SCIENCE
, 1997
"... We consider slender languages, that is, languages for which the number of words of the same length is bounded from above by a constant. We prove that the slenderness problem is decidable for contextfree languages and that the maximal number of words of the same length in a given contextfree langua ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We consider slender languages, that is, languages for which the number of words of the same length is bounded from above by a constant. We prove that the slenderness problem is decidable for contextfree languages and that the maximal number of words of the same length in a given contextfree
The language of Lyndon words is not contextfree
"... A word is primitive if it is not a proper power of a shorter word. A Lyndon word is a primitive word which is minimal under cyclic permutation (for properties of these words, see [the new printing of] Lothaire's book [4]). The status of the languages Q of primitive words and L of Lyndon words w ..."
Abstract
 Add to MetaCart
A word is primitive if it is not a proper power of a shorter word. A Lyndon word is a primitive word which is minimal under cyclic permutation (for properties of these words, see [the new printing of] Lothaire's book [4]). The status of the languages Q of primitive words and L of Lyndon words with
On Strongly ContextFree Languages
"... Starting from the question (inspired by the socalled computing by carving, ..."
Abstract
 Add to MetaCart
Starting from the question (inspired by the socalled computing by carving,
Active contextfree games
 In STACS
, 2004
"... Abstract. An Active ContextFree Game is a game with two players (Romeo and Juliet) on strings over a finite alphabet. In each move, Juliet selects a position of the current word and Romeo rewrites the corresponding letter according to a rule of a contextfree grammar. Juliet wins if a string of the ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
Abstract. An Active ContextFree Game is a game with two players (Romeo and Juliet) on strings over a finite alphabet. In each move, Juliet selects a position of the current word and Romeo rewrites the corresponding letter according to a rule of a contextfree grammar. Juliet wins if a string
Subtyping of ContextFree Classes
, 1998
"... Objectoriented systems are usually not designed from scratch but constructed using frameworks or class libraries. This construction should lead to correct systems provided the reused classes are locally correct. Therefore, knowledge about the features that a certain class provides is often not en ..."
Abstract
 Add to MetaCart
Objectoriented systems are usually not designed from scratch but constructed using frameworks or class libraries. This construction should lead to correct systems provided the reused classes are locally correct. Therefore, knowledge about the features that a certain class provides is often
Results 1  10
of
1,251,923