Chomsky hierarchy

About: Chomsky hierarchy is a research topic. Over the lifetime, 601 publications have been published within this topic receiving 31067 citations. The topic is also known as: Chomsky–Schützenberger hierarchy.

Embedding domain specific languages in the attribute grammar formalism

Abstract: This paper presents techniques for the design and implementation of domain specific languages. Our techniques are based on higher-order attribute grammars. Formal languages are specified in the classical attribute formalism and domain specific languages are embedded in the specification via higher-order attributes. We present a domain specific language for pretty-printing and we show how such language can be easily embedded in the specification of a powerful spreadsheet-like tool. From such specification an incremental implementation is automatically derived and the first results are presented.

Relating logical neural network to conventional models of computation

Abstract: The author compares the class of languages that can be recognized by a logical neural network (LNN) with the classes of languages in Chomsky hierarchy. The computability of LNN is studied. The computation power of LNN is identical to the computation of a probabilistic automaton, that is, it is possible to recognize more than finite state languages with such machines. This indicates what can be expected from LNN, i.e. which functions this kind of network can learn. >

Stochastic Methods for Generative Systems Analysis

Abstract: A very important part in the process of transmission of information is that of generation of the words. For some time past we tried to consider the process of generation of the words by generative systems, from a stochastic point of view involving Markov chains. Because the sequences of intermediate word (called derivations) by which a word can be generated are finite, it results that finite Markov chains will be connected to the process. In order to our discussion should be as general as possible we consider generative systems free of any restrictions. The model of such systems is offered by the most general class of formal grammars from the so-called Chomsky hierarchy, namely the phrase-structure grammars. The novelty that we have proposed consists in a new organization of the process of generation of the words by considering the set of all the derivations split into equivalence classes, each of them containing derivations of the same length. In this way our results are available up to an equivalence.