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
Posted Content•
TL;DR: A class of unification grammars is defined that exactly describes the class of indexed languages.
Abstract: Indexed languages are interesting in computational linguistics because they are the least class of languages in the Chomsky hierarchy that has not been shown not to be adequate to describe the string set of natural language sentences. We here define a class of unification grammars that exactly describe the class of indexed languages.
1 citations
TL;DR: A new class of grammars with the help of weightfunctions is exhibited, characterized by decreasing the weight during the derivation process, which is identical to the class of ultralinear languages.
Abstract: We exhibit a new class of grammars with the help of weightfunctions. They are characterized by decreasing the weight during the derivation process. A decision algorithm for the emptiness problem is developed. This class contains non-contextfree grammars. The corresponding language class is identical to the class of ultralinear languages.
1 citations
TL;DR: It is shown that context‐sensitive languages exist which can be generated by context‐free parallel grammars, and that CFPL is a more effective tool for modelling computer programming languages than CFL, especially for parallelComputer programming languages, for example, the ADA programming language.
Abstract: Describes intuitively the fact that four types of formal languages can be generated by four types of grammars or can be recognized by four types of automata. Gives the relationships between context‐sensitive languages and computer programming languages. Defines and investigates parallel productions, parallel grammars, and context‐free parallel grammars. Shows that context‐sensitive languages exist which can be generated by context‐free parallel grammars. In addition, states the advantages of context‐free parallel grammars. Also shows that context‐free languages (CFL) are a proper subset of context‐free parallel languages (CFPL). Furthermore, CFPL is a more effective tool for modelling computer programming languages than CFL, especially for parallel computer programming languages, for example, the ADA programming language. Also illustrates context‐sensitive property of recognizing hand‐written characters. The results may have useful applications in artificial intelligence, model parallel computer programming languages, software engineering, expert systems and robotics.
1 citations
01 Feb 1986
TL;DR: Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage.
Abstract: Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
1 citations
TL;DR: The class of reducing transition languages introduced by Eickel, Paul, Bauer, and Samelson is shown to be a proper superclass of the simple precedence languages and is equivalent to the class of deterministic context free languages.
Abstract: The class of reducing transition languages introduced by Eickel, Paul, Bauer, and Samelson was shown by Morris to be a proper superclass of the simple precedence languages. In this paper this result is extended, showing that, in fact, the first class is equivalent to the class of deterministic context free languages.
1 citations