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.

On the Formal Definition of Assembly Languages.

Abstract: A method for forming a negative image comprising imagewise exposing a photographic material to provide exposed areas and unexposed areas, said material comprising, on a support, (1) an emulsion layer containing a light-sensitive silver halide, (2) unsensitized silver halide metallic salt grains which are more soluble in a developer than the light sensitive silver halide, and (3) nuclei for physical development, processing said material in the presence of a reducing agent and a solvent for said grains with said developer containing a substance which renders said grains less soluble by adsorbing thereto, said developer rendering said grains in said exposed areas and not in said unexposed areas soluble in said solvent, whereby metal ions are released and deposited on said nuclei.

The generative power of weighted one-sided and regular sticker systems

Abstract: Sticker systems were introduced in 1998 as one of the DNA computing models by using the recombination behavior of DNA molecules. The Watson-Crick complementary principle of DNA molecules is abstractly used in the sticker systems to perform the computation of sticker systems. In this paper, the generative power of weighted one-sided sticker systems and weighted regular sticker systems are investigated. Moreover, the relationship of the families of languages generated by these two variants of sticker systems to the Chomsky hierarchy is also presented.

Context sensitive table linden mayer languages and a relation to the LBA problem

Abstract: Families of languages generated by classes of context sensitive Lindenmayer systems with tables using nonterminals are classified in the Chomsky hierarchy. It is shown that the family of languages generated by deterministic λ -free left context sensitive L systems with two tables using nonterminals coincides with the context sensitive languages. Combined with the fact that the family of languages generated by deterministic λ -free context sensitive L systems (with one table) using nonterminals is equal to the DLBA languages this shows the classic LBA problem to be equivalent to whether or not a trade-off is possible between one-sided context with two tables and two-sided context with one table for deterministic λ -free L systems using nonterminals. Without the restriction to λ -freeness such a trade-off is possible since the recursively enumerable languages are generated in both cases. By stating the results in their strongest form, a complete classification of the considered language families is obtained since the hierarchies induced by the involved parameters ( λ -freeness, determinism, number of tables, amount of context, closure under various types of homomorphisms) basically collapse to the recursively enumerable languages, context sensitive languages, and DLBA languages.