Results 1  10
of
550,832
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
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
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
ContextFree Languages, Coalgebraically
, 2011
"... We give a coalgebraic account of contextfree languages using the functor D(X) =2 × X A for deterministic automata over an alphabet A, in three different but equivalent ways: (i) by viewing contextfree grammars as Dcoalgebras; (ii) by defining a format for behavioural differential equations (w.r. ..."
Abstract

Cited by 10 (8 self)
 Add to MetaCart
We give a coalgebraic account of contextfree languages using the functor D(X) =2 × X A for deterministic automata over an alphabet A, in three different but equivalent ways: (i) by viewing contextfree grammars as Dcoalgebras; (ii) by defining a format for behavioural differential equations (w
Logics For ContextFree Languages
, 1995
"... We define matchings, and show that they capture the essence of contextfreeness. More precisely, we show that the class of contextfree languages coincides with the class of those sets of strings which can be defined by sentences of the form 9 b', where ' is first order, b is a binary pre ..."
Abstract

Cited by 27 (5 self)
 Add to MetaCart
We define matchings, and show that they capture the essence of contextfreeness. More precisely, we show that the class of contextfree languages coincides with the class of those sets of strings which can be defined by sentences of the form 9 b', where ' is first order, b is a binary
Transductions and contextfree languages
 Ed. Teubner
, 1979
"... 1.1 Notation and examples......................... 3 ..."
Abstract

Cited by 292 (4 self)
 Add to MetaCart
1.1 Notation and examples......................... 3
1 ContextFree Languages
"... This material is described in Chapter 10 of the textbook. • Contextfree grammars are the most widely used specification tool for the syntactic structure of programming languages. • Contextfree grammars are more powerful than state diagrams, that is, they define a larger class of languages. Backus ..."
Abstract
 Add to MetaCart
This material is described in Chapter 10 of the textbook. • Contextfree grammars are the most widely used specification tool for the syntactic structure of programming languages. • Contextfree grammars are more powerful than state diagrams, that is, they define a larger class of languages. Backus
ContextFree Language Induction by
"... The process of learning often consists of Inductive Inference, making generalizations from samples. The problem here is finding generalizations (Grammars) for Formal Languages from finite sets of positive and negative sample sentences. The focus of this paper is on ContextFree Languages (CFL&a ..."
Abstract
 Add to MetaCart
The process of learning often consists of Inductive Inference, making generalizations from samples. The problem here is finding generalizations (Grammars) for Formal Languages from finite sets of positive and negative sample sentences. The focus of this paper is on ContextFree Languages (CFL
On Bounded ContextFree Languages
"... Stratified linear sets play a central role in the theory of bounded contextfree languages developed by Ginsburg [4]. The "FlipFlop Lemma," (K aszonyi [6]), states, that the vectorset f (e0 ; : : : ; em 1 ) 2 IN m j 0 e0 + + m 1 em 1 6= 0 g; where i 2 f1; 0; 1g, for i = 0; : : : ; m 1, a ..."
Abstract
 Add to MetaCart
Stratified linear sets play a central role in the theory of bounded contextfree languages developed by Ginsburg [4]. The "FlipFlop Lemma," (K aszonyi [6]), states, that the vectorset f (e0 ; : : : ; em 1 ) 2 IN m j 0 e0 + + m 1 em 1 6= 0 g; where i 2 f1; 0; 1g, for i = 0; : : : ; m 1
On Parikh Slender ContextFree Languages
, 1997
"... In a recent paper we defined and studied Parikh slender languages and showed that they can be used in simplifying ambiguity proofs of contextfree languages. In this paper Parikh slender contextfree languages are characterized. The characterization has diverse applications. ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
In a recent paper we defined and studied Parikh slender languages and showed that they can be used in simplifying ambiguity proofs of contextfree languages. In this paper Parikh slender contextfree languages are characterized. The characterization has diverse applications.
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
Results 1  10
of
550,832