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: A generalization of pregroup, by which a freely-generated pregroup is augmented with a finite set of commuting inequations, allowing limited commutativity and cancelability, is presented.
Abstract: The paper presents a generalization of pregroup, by which a freely-generated pregroup is augmented with a finite set of commuting inequations, allowing limited commutativity and cancelability. It is shown that grammars based on the commutation-augmented pregroups generate mildly context-sensitive languages. A version of Lambek’s switching lemma is established for these pregroups. Polynomial parsability and semilinearity are shown for languages generated by these grammars.
16 citations
Proceedings Article•
01 Jan 1995
16 citations
Journal Article•
TL;DR: A model is presented to characterize the class of languages obtained by adding reduplication to context-free languages, which appears capable of accommodating the sort of reduplications that have been observed to occur in natural languages, but which excludes many of the unnatural constructions.
Abstract: A model is presented to characterize the class of languages obtained by adding reduplication to context-free languages. The model is a pushdown automaton augmented with the ability to check reduplication by using the stack in a new way. The class of languages generated is shown to lie strictly between the context-free languages and the indexed languages. The model appears capable of accommodating the sort of reduplications that have been observed to occur in natural languages, but it excludes many of the unnatural constructions that other formal models have permitted.
16 citations
Journal Article•
TL;DR: A class of two-dimensional array grammars are considered that extend the contextual operations on strings to arrays in a naturalway and generate languages of pictures of rectangular arrays.
Abstract: In this paper, we consider a class of two-dimensional array grammars, called parallel contextual array grammars, that extend the contextual operations on strings to arrays in a naturalway and generate languages of pictures of rectangular arrays. Several classes of these array grammars and the resulting families of picture languages are considered. Necessary conditions for picture languages to be contained in these classes are obtained and the relations between these families are also established.
16 citations
01 Feb 2001
TL;DR: This work sheds some light on the relations to the context-free languages and some of their important subfamilies in automata arrays as acceptors for formal languages.
Abstract: From a biological point of view automata arrays have been employed by John von Neumann in order to solve the logical problem of nontrivial self-reproduction. From a computer science point of view they are a model for massively parallel computing systems. Here we are dealing with automata arrays as acceptors for formal languages. Our focus of investigation concerns their capabilities to accept the classical linguistic languages. While there are simple relations to the regular and context-sensitive ones, here we shed some light on the relations to the context-free languages and some of their important subfamilies.
16 citations