Results 1  10
of
170
THE ALGORITHM FOR REDUCING THE NUMBER OF THE NONTERMINAL SYMBOLS IN THE FE0L SYSTEMS ABSTRACT
"... This paper introduces FE0L (forbidding contextfree L systems) and FET0L (FE0L systems with tables) systems with permitting conditions and the algorithm for reducing the number of the nonterminal symbols in FE0L (FET0L) systems. The productions of FE0L (FET0L) systems (grammars) do not have only the ..."
Abstract
 Add to MetaCart
This paper introduces FE0L (forbidding contextfree L systems) and FET0L (FE0L systems with tables) systems with permitting conditions and the algorithm for reducing the number of the nonterminal symbols in FE0L (FET0L) systems. The productions of FE0L (FET0L) systems (grammars) do not have only
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 569 (0 self)
 Add to MetaCart
of this process when some of the attributes are "synthesized", i.e., defined solely in terms of attributes of the descendants of the corresponding nonterminal symbol, while other attributes are "inherited", i.e., defined in terms of attributes of the ancestors of the nonterminal symbol
Learning Accurate, Compact, and Interpretable Tree Annotation
 In ACL ’06
, 2006
"... We present an automatic approach to tree annotation in which basic nonterminal symbols are alternately split and merged to maximize the likelihood of a training treebank. Starting with a simple Xbar grammar, we learn a new grammar whose nonterminals are subsymbols of the original nonterminals. In co ..."
Abstract

Cited by 423 (42 self)
 Add to MetaCart
We present an automatic approach to tree annotation in which basic nonterminal symbols are alternately split and merged to maximize the likelihood of a training treebank. Starting with a simple Xbar grammar, we learn a new grammar whose nonterminals are subsymbols of the original nonterminals
Refining the nonterminal complexity of graphcontrolled grammars
 In Proceedings of the DCFS
, 2005
"... We refine the classical notion of the nonterminal complexity of graphcontrolled grammars, programmed grammars, and matrix grammars by also counting, in addition, the number of nonterminal symbols that are actually used in the appearance checking mode. We prove that every recursively enumerable lang ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
We refine the classical notion of the nonterminal complexity of graphcontrolled grammars, programmed grammars, and matrix grammars by also counting, in addition, the number of nonterminal symbols that are actually used in the appearance checking mode. We prove that every recursively enumerable
Generalized Use of NonTerminal Symbols for Procedural Modeling
 COMP. GRAPH. FORUM
, 2010
"... We present the new procedural modeling language G2 (Generalized Grammar) which adapts various concepts from general purpose programming languages in order to provide high descriptive power with welldefined semantics and a simple syntax which is easily readable even by nonprogrammers. The term &quo ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
"Generalized" reflects two kinds of generalization. On the one hand we extend the scope of previous architectural modeling languages by allowing for multiple types of nonterminal objects with domainspecific operators and attributes. On the other hand the language accepts nonterminal symbols
Grammars with Scattered Nonterminals
, 2002
"... We investigate rewriting systems, grammars with scattered nonterminals, which extend the generative capacity of contextfree grammars. They can be thought of as having sentential forms where some instances of a nonterminal may be coupled. The contextfreelike productions replace a nonterminal toget ..."
Abstract
 Add to MetaCart
We investigate rewriting systems, grammars with scattered nonterminals, which extend the generative capacity of contextfree grammars. They can be thought of as having sentential forms where some instances of a nonterminal may be coupled. The contextfreelike productions replace a nonterminal
NonTermination Checking for Imperative Programs
"... Abstract. While termination checking tailored to realworld library code or frameworks has received everincreasing attention during the last years, the complementary question of disproving termination properties as a means of debugging has largely been ignored so far. We present an approach to auto ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
to automatic nontermination checking that relates to termination checking in the same way as symbolic testing does to program verification. Our method is based on the automated generation of invariants that show that terminating states of a program are unreachable from certain initial states. Such initial
A Corpusbased Probabilistic Grammar with Only Two Nonterminals
 Proceedings Fourth International Workshop on Parsing Technologies
, 1995
"... The availability of large, syntacticallybracketed corpora such as the Penn Tree Bank affords us the opportunity to automatically build or train broadcoverage grammars, and in particular to train probabilistic grammars. A number of recent parsing experiments have also indicated that grammars whose ..."
Abstract

Cited by 88 (3 self)
 Add to MetaCart
production probabilities are dependent on the context can be more effective than contextfree grammars in selecting a correct parse. To make maximal use of context, we have automatically constructed, from the Penn Tree Bank version 2, a grammar in which the symbols S and NP are the only real nonterminals
Linear Conjunctive Languages Are Closed Under Complement
, 2002
"... Linear conjunctive grammars are conjunctive grammars in which the body of each conjunct contains no more than a single nonterminal symbol. ..."
Abstract
 Add to MetaCart
Linear conjunctive grammars are conjunctive grammars in which the body of each conjunct contains no more than a single nonterminal symbol.
A logic for nonterminating Golog programs
 In Proc. KR 2008
, 2008
"... Typical Golog programs for robot control are nonterminating. Analyzing such programs so far requires metatheoretic arguments involving complex fixpoint constructions. In this paper we propose a logic based on the situation calculus variant ES, which includes elements from branching time, dynami ..."
Abstract

Cited by 23 (4 self)
 Add to MetaCart
, dynamic and process logics and where the meaning of programs is modelled as possibly infinite sequences of actions. We show how properties of nonterminating programs can be formulated in the logic and, for a subset of it, how existing ideas from symbolic model checking in temporal logic can be applied
Results 1  10
of
170