Topic
Indexed language
About: Indexed language is a research topic. Over the lifetime, 334 publications have been published within this topic receiving 11000 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: Terminally coded (TC) grammars are introduced, which generalize parenthesis Grammar in the sense that from each word ω generated by a TC grammar the authors can recover the unlabeled tree t underlying its derivation tree(s), and there is a length-preserving homomorphism that maps ω to an encoding of t.
Abstract: We introduce terminally coded (TC) grammars, which generalize parenthesis grammars in the sense that from each word ω generated by a TC grammar we can recover the unlabeled tree t underlying its derivation tree(s). More precisely, there is a length-preserving homomorphism that maps ω to an encoding of t. Basic properties of TC grammars are established. For backwards deterministic TC grammars we give a shift-reduce precedence parsing method without look-ahead, which implies that TC languages can be recognized in linear time. The class of TC languages contains all parenthesis languages, and is contained in the classes of simple precedence languages and NTS languages.
1 citations
TL;DR: In this article, the DSV method of computing the growth series of an unambiguous context-free language is extended to a larger class of indexed languages, and the technique is used to define a class of languages.
Abstract: We extend the DSV method of computing the growth series of an unambiguous context-free language to the larger class of indexed languages. We illustrate the technique with numerous examples.
1 citations
TL;DR: The present paper examines the source of this expressive power of graph grammars by analyzing complexity and decidability of the so-called k-connecting Lin-A-NLC (k-Lin-A -NLC) grammARS in which the right-hand side of each production contains at most k nodes that can be connected to outside nodes.
1 citations
01 Jan 2012
TL;DR: Examples of the transformation of context-free grammars in the objects of a new formalism, which is a special extension of the class of nondeterministic finite automata, can define all the possible context- free languages.
Abstract: Keywords: nondeterministic finite automata; context-free languages; algorithms of equivalent transformation.Annotation: This article provides examples of the transformation of context-free grammars in the objects of a new formalism, which is a special extension of the class of nondeterministic finite automata. The objects of this for-malism can define all the possible context-free languages.
1 citations
01 Sep 2008
TL;DR: The paper proves a pumping lemma for a certain subclass of mildly context-sensitive languages, the one defined by commutation-augmented pregroup grammars, and introduces an automaton equivalent to such grammar, augmenting push-down automata by cancellation in the bottom of its stack.
Abstract: The paper proves a pumping lemma for a certain subclass of mildly context-sensitive languages, the one defined by commutation-augmented pregroup grammars; in addition, an automaton equivalent to such grammars is introduced, augmenting push-down automata by cancellation in the bottom of its stack.
1 citations