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.

Convex and anti-convex languages

Abstract: We define here the counterpart of Jensen convex and anti-convex sets of real numbers for the case of languages. We investigate the existence of languages consisting only of strings in which a set of symbols is convex or anti-convex, as well as the place of such languages in Chomsky hierarchy. Local convexity is also briefly investigated.

Chomsky, Knowledge of Languageand the Rule-Following Considerations

Abstract: According to Noam Chomsky, speakers of a language have a substantial body of propositional knowledge of that language that they draw upon in language production and comprehension. Since the late 1950s Chomsky"s project has been to characterise that knowledge and give an account of its acquisition. Arguably, one of the most powerful philosophical challenges to Chomsky"s output is generated by the rule following considerations of Philosophical Investigations §§ 138-242. My aim in this paper is to characterise the nature of this challenge, a topic that, rather surprisingly, has received relatively little attention in the philosophical literature.

Using formal grammars to encode expert problem solving knowledge

Abstract: Investigations into differences between expert and novice problem-solving techniques falls within the area of cognitive science. Cognitive science refers to the interdisciplinary study of the acquisition and use of knowledge [1]. The field includes as contributing disciplines: artificial intelligence, cognitive psychology, linguistics, philosophy of mind and language, anthropology, neuroscience, and education. The cognitive science movement is very diverse, containing within it several viewpoints.

On Derivation Languages of Flat Splicing Systems.

Abstract: In this work, we associate the idea of derivation languages with at splicing systems and compare the languages generated as derivation languages (Szilard and Control languages) with the family of languages in Chomsky hierarchy. We show that there exist regular languages which cannot be generated as a Szilard language by any labeled flat splicing system. But some context-sensitive languages can be generated as a Szilard language by alphabetic labeled flat splicing systems. Also, any regular, context-free and recursively enumerable language can be represented as a homomorphic image of the Szilard language generated by the labeled flat splicing systems of type (1, 2); (2, 3) and (4, 3) respectively. We also introduce the idea of Control languages for labeled finite flat splicing systems and show that any regular and context-free language can be generated as a Control language by these systems of type (1, 2) and (2,*) respectively. At the end we show that any recursively enumerable language can be generated as a Control language of labeled flat splicing systems of type (4, 3) when {\lambda}-labeled rules are allowed.