Results 1  10
of
1,210,656
COALGEBRAIC CHARACTERIZATIONS OF CONTEXTFREE LANGUAGES
, 2012
"... Vol. 9(3:14)2013, pp. 1–39 www.lmcsonline.org ..."
Coalgebraic characterizations of contextfree languages
 Logical Methods in Computer Science
"... Abstract. In this article, we provide three coalgebraic characterizations of the class of contextfree languages, each based on the idea of adding coalgebraic structure to an existing algebraic structure by specifying outputderivative pairs. Final coalgebra semantics then gives an interpretation fu ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. In this article, we provide three coalgebraic characterizations of the class of contextfree languages, each based on the idea of adding coalgebraic structure to an existing algebraic structure by specifying outputderivative pairs. Final coalgebra semantics then gives an interpretation
Characterization of ContextFree Languages with Polynomially Bounded Ambiguity
 Proceedings of the MFCS 2001, Mariánské Lázně, (Czech Republic), 2001, number 2136 in Lecture Notes in Computer Science
, 2001
"... We prove that the class of contextfree languages with polynomially bounded ambiguity (PCFL) is the closure of the class of unambiguous languages (UCFL) under projections which deletes Parikh bounded symbols only. A symbol a is Parikh bounded in a language L if there is a constant c such that no ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We prove that the class of contextfree languages with polynomially bounded ambiguity (PCFL) is the closure of the class of unambiguous languages (UCFL) under projections which deletes Parikh bounded symbols only. A symbol a is Parikh bounded in a language L if there is a constant c
Contextfree characterizations of indexed languages
"... Indexed languages are languages recognized by pushdown automata of level 2 and by indexed grammars. We propose here some new characterizations linking indexed languages to contextfree languages: the class of indexed languages is the image of the Dyck language by a nice class of contextfree transd ..."
Abstract
 Add to MetaCart
Indexed languages are languages recognized by pushdown automata of level 2 and by indexed grammars. We propose here some new characterizations linking indexed languages to contextfree languages: the class of indexed languages is the image of the Dyck language by a nice class of contextfree
A Class of P Automata for Characterizing Contextfree Languages
"... We present a characterization of contextfree languages in terms of a restricted class of P automata (P systems accepting strings of symbols using symport/antiport communication rules). The characterization is based on the form of the rules used by the system. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We present a characterization of contextfree languages in terms of a restricted class of P automata (P systems accepting strings of symbols using symport/antiport communication rules). The characterization is based on the form of the rules used by the system.
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
An Efficient ContextFree Parsing Algorithm
, 1970
"... A parsing algorithm which seems to be the most efficient general contextfree algorithm known is described. It is similar to both Knuth's LR(k) algorithm and the familiar topdown algorithm. It has a time bound proportional to n 3 (where n is the length of the string being parsed) in general; i ..."
Abstract

Cited by 794 (0 self)
 Add to MetaCart
; it has an n 2 bound for unambiguous grammars; and it runs in linear time on a large class of grammars, which seems to include most practical contextfree programming language grammars. In an empirical comparison it appears to be superior to the topdown and bottomup algorithms studied by Griffiths
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
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
The C Programming Language
, 1988
"... The C programming language was devised in the early 1970s as a system implementation language for the nascent Unix operating system. Derived from the typeless language BCPL, it evolved a type structure; created on a tiny machine as a tool to improve a meager programming environment, it has become on ..."
Abstract

Cited by 1527 (16 self)
 Add to MetaCart
The C programming language was devised in the early 1970s as a system implementation language for the nascent Unix operating system. Derived from the typeless language BCPL, it evolved a type structure; created on a tiny machine as a tool to improve a meager programming environment, it has become
Results 1  10
of
1,210,656