On Chomsky Hierarchy of Palindromic Languages

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

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.

متن کامل

Natural Languages And The Chomsky Hierarchy

The central claim of the paper is that NL stringsets are regular. Three independent arguments are offered in favor of this position: one based on parsimony considerations, one employing the McCullogh-Pitts (1943) model of neurons, and a purely linguistic one. It is possible to derive explicit upper bounds for the number of (live) states in NL acceptors: the results show that finite state NL par...

متن کامل

G-automata, Counter Languages and the Chomsky Hierarchy

We consider how the languages of G-automata compare with other formal language classes. We prove that if the word problem of G is accepted by a machine in the class M then the language of any G-automaton is in the class M. It follows that the so called counter languages (languages of Zn-automata) are context-sensitive, and further that counter languages are indexed if and only if the word probl...

متن کامل

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...

متن کامل

Towards a Coalgebraic Chomsky Hierarchy

The Chomsky hierarchy plays a prominent role in the foundations of theoretical computer science relating classes of formal languages of primary importance as well as the grammars and machine models that represent those language classes. It is well-known that regular languages can be captured by coalgebras. They form precisely the image of all finite coalgebras for the set functor X 7→ 2×X under...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Acta Cybernetica

سال: 2016

ISSN: 0324-721X

DOI: 10.14232/actacyb.22.3.2016.10