scispace - formally typeset
Search or ask a question
Topic

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.


Papers
More filters
Book ChapterDOI
24 Aug 1981

9 citations

Proceedings ArticleDOI
18 May 1993
TL;DR: The concept of unambiguity, common to both areas, is treated in detail and some new results on deterministic families of formal languages and on complexities of operations on formal languages are indicated.
Abstract: Some connections between formal languages and complexity are reviewed. Families of formal languages are treated with complexity theoretical methods. In particular, the concept of unambiguity, common to both areas, is treated in detail. Some new results on deterministic families of formal languages and on complexities of operations on formal languages are indicated. >

9 citations

Journal Article
TL;DR: The computational power of the obtained classes of P systems in comparison with families of languages generated by grammars in the Chomsky hierarchy or with CD grammar systems is described and several problems for future research are formulated.
Abstract: In this paper we discuss some relationships between grammar systems and P systems (membrane systems), two areas of computer science dealing with distributed computing models, but with different motivations and different types of basic ingredients. We extend one of the most important communication protocols of cooperating distributed (CD) grammar systems, the so-called t-derivation mode, to P systems with string-objects: if no rule can be applied to a string in a region of a P system, then the string is moved to a neighbouring region, depending on the communication mode either in exactly one direction (in or out) or in both directions. We describe the computational power of the obtained classes of P systems in comparison with families of languages generated by grammars in the Chomsky hierarchy or with CD grammar systems and formulate several problems for future research.

9 citations

Proceedings ArticleDOI
05 Jul 1988
TL;DR: A precise notion of a formal framework meant to capture the intuition of an open-ended range of deductive interpreted languages is proposed, and a particular framework called the logical theory of constructions (LTC) is developed as an example.
Abstract: A precise notion of a formal framework, meant to capture the intuition of an open-ended range of deductive interpreted languages, is proposed. A particular framework called the logical theory of constructions (LTC) is developed as an example. A series of languages in the LTC framework is defined, demonstrating how a language can be thought of as gradually evolving. >

9 citations

Journal ArticleDOI
Kaoru Fujioka1
TL;DR: New characterizations of regular, context-free, and recursively enumerable languages, using insertion systems with lower complexity are concerns by using both strictly locally testable languages and morphisms.
Abstract: This paper concerns new characterizations of regular, context-free, and recursively enumerable languages, using insertion systems with lower complexity. This is achieved by using both strictly locally testable languages and morphisms. The representation is in a similar way to the Chomsky-Schutzenberger representation of context-free languages. Specifically, each recursively enumerable language L can be represented in the form L=h(L(γ)∩R), where γ is an insertion system of weight (3,3), R is a strictly 2-testable language, and h is a projection. A similar representation can be obtained for context-free languages, using insertion systems of weight (2,0) and strictly 2-testable languages, as well as for regular languages, using insertion systems of weight (1,0) and strictly 2-testable languages.

9 citations


Network Information
Related Topics (5)
Rule-based machine translation
8.8K papers, 240.5K citations
72% related
Syntax
16.7K papers, 518.6K citations
71% related
Time complexity
36K papers, 879.5K citations
71% related
Type (model theory)
38.9K papers, 670.5K citations
70% related
Semantics
24.9K papers, 653K citations
70% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20232
20223
20219
20208
201912
201810