On Chomsky Hierarchy of Palindromic Languages
نویسندگان
چکیده
The characterization of the structure of palindromic regular and palindromic context-free languages is described by S. Horváth, J. Karhumäki, and J. Kleijn in 1987. In this paper alternative proofs are given for these characterizations.
منابع مشابه
Formal language theory: refining the Chomsky hierarchy.
The first part of this article gives a brief overview of the four levels of the Chomsky hierarchy, with a special emphasis on context-free and regular languages. It then recapitulates the arguments why neither regular nor context-free grammar is sufficiently expressive to capture all phenomena in the natural language syntax. In the second part, two refinements of the Chomsky hierarchy are revie...
متن کاملTopological Complexity of Context-Free ω-Languages: A Survey
We survey recent results on the topological complexity of context-free ω-languages which form the second level of the Chomsky hierarchy of languages of infinite words. In particular, we consider the Borel hierarchy and the Wadge hierarchy of non-deterministic or deterministic context-free ω-languages. We study also decision problems, the links with the notions of ambiguity and of degrees of amb...
متن کاملTopological Complexity of Context-Free omega-Languages: A Survey
We survey recent results on the topological complexity of context-free ω-languages which form the second level of the Chomsky hierarchy of languages of infinite words. In particular, we consider the Borel hierarchy and the Wadge hierarchy of non-deterministic or deterministic context-free ω-languages. We study also decision problems, the links with the notions of ambiguity and of degrees of amb...
متن کاملReflection in the Chomsky Hierarchy
The class of regular languages can be generated from the regular expressions. These regular expressions, however, do not themselves form a regular language, as can be seen using the pumping lemma. On the other hand, the class of enumerable languages can be enumerated by a universal language that is one of its elements. We say that the enumerable languages are reflexive. In this paper we investi...
متن کاملOn String Languages Generated by Numerical P Systems
Numerical P systems are a class of P systems inspired both from the structure of living cells and from economics. Usually, they are used as devices for computing sets of numbers. In this work, we consider numerical P systems as language generators: symbols are associated with numbers (portions of the “production value”) sent to the environment. The generative capacity of such systems is investi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Acta Cybern.
دوره 22 شماره
صفحات -
تاریخ انتشار 2016