Topic
Context-sensitive grammar
About: Context-sensitive grammar is a research topic. Over the lifetime, 1938 publications have been published within this topic receiving 45911 citations. The topic is also known as: CSG.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: The membership problem for fixed context-sensitive languages is polynomial if the right hand side of every production is strictly longer than the left hand side.
104 citations
••
01 Jan 1997TL;DR: This chapter discusses certain most characteristic links between proof theory and formal grammars and aims to persuade the reader of the generic unity of proof structures in appropriate deductive systems and syntactic and semantic structures generated by corresponding Grammars.
Abstract: Publisher Summary In the traditional sense of the term, “mathematical linguistics” is a branch of applied algebra mainly concerned with formal languages, formal grammars, and automata—the latter being purely computational devices that generate formal languages. A natural link between proof theory and semantics has been established by the constructive approaches in logic as the so–called “formulas-as-types” interpretation: typed lambda terms can be interpreted as formal proofs in natural deduction systems. This chapter discusses certain most characteristic links between proof theory and formal grammars. It aims to persuade the reader of the generic unity of proof structures in appropriate deductive systems and syntactic and semantic structures generated by corresponding grammars. The chapter discusses some algebra connected with syntactic structures determined by proofs in the deductive part of grammars. The algebraic models of deductive systems underlying grammars are considered in the chapter. The algebraic models of logical systems are a traditional domain of metalogic. Substructural logics relevant to the theory of grammar give rise to special algebraic structures residuated algebras.
102 citations
••
05 Mar 1990TL;DR: The very high level language PROGRESS as discussed by the authors is the first statically typed language which is based on the concepts of PRO grammed Graph RE-writing SyStems and it supports different programming paradigms by offering procedural and declarative programming constructs.
Abstract: The Very High Level language PROGRESS presented within this paper is the first statically typed language which is based on the concepts of PRO grammed Graph RE-writing SyStems. This language supports different programming paradigms by offering procedural and declarative programming constructs for the definition of integrity constraints, functional attribute dependencies, derived binary relationships, atomic graph rewrite rules, and complex graph transformations.
101 citations
••
01 Jan 2012TL;DR: A method for harvesting invention fowl which includes the steps of horizontally extending beneath the fowl, in a confined area, a plurality of lifting fingers.
Abstract: A method for harvesting invention fowl which includes the steps of horizontally extending beneath the fowl, in a confined area, a plurality of lifting fingers; raising and pivoting the fingers to lift the fowl and supporting them at least in part upon a continuously moving structure; continuing to said the fowl on the continuously moving structure to convey the fowl to a cooping location; and moving the fowl into a coop from the continuously moving structure.
100 citations
••
TL;DR: The family of LR-regular languages is studied; it properly includes the family of deterministic CF languages and has similar properties.
99 citations