is to prove that if L is a context-free language, then the language Min(L) context-free.

"Meaning " may be assigned to a string in a context-free language by defining "at-tributes " of the symbols in a derivation tree for that string. The attributes can be de-fined by functions associated with each production in the grammar. This paper examines the implications

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

slender context-free 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: context-free language, slender

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 context-free languages and that the maximal number of words of the same length in a given context-free

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

Starting from the question (inspired by the so-called computing by carving,

Abstract. An Active Context-Free 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 context-free grammar. Juliet wins if a string

Object-oriented 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

Abstract not found