Mixed computation: grammar up and down the Chomsky hierarchy by Krivochen, DG

The Non-Hierarchical Nature of the Chomsky Hierarchy-Driven Artificial-Grammar Learning by Shiro Ojima, Kazuo Okanoya

“…Recent artificial-grammar learning (AGL) paradigms driven by the Chomsky hierarchy paved the way for direct comparisons between humans and animals in the learning of center embedding ([A[AB]B]). …”
Get full text

Systems Underlying Human and Old World Monkey Communication: One, Two, or Infinite by Shigeru Miyagawa, Shigeru Miyagawa, Esther Clarke, Esther Clarke

Subjects: Get full text

Knots, Language, and Computation: A Bizarre Love Triangle? Replies to Objections by Sergio Balari, Antonio Benítez-Burraco, Marta Camps, V?ctor M. Longa, Guillermo Lorenzo

Subjects: Get full text

Merge-Generability as the Key Concept of Human Language: Evidence From Neuroscience by Kyohei Tanaka, Isso Nakamura, Shinri Ohta, Naoki Fukui, Mihoko Zushi, Hiroki Narita, Kuniyoshi L. Sakai

Subjects: Get full text

Classification of n-th order limit language in formal language classes by Siti Hajar, Mohd Khairuddin, Muhammad Azrin, Ahmad, Mohd Sham, Mohamad

“…Since then, the researchers have been eager to classify the splicing language into certain classes in the Chomsky hierarchy, such as context-free language, contextsensitive language and recursive enumerable language. …”
Get full text

Groups with context-free Diophantine problem by Vladimir Yankovskiy

“…We find algebraic conditions on a group equivalent to the position of its Diophantine problem in the Chomsky Hierarchy. In particular, we prove that a finitely generated group has a context-free Diophantine problem if and only if it is finite.…”
Get full text

Computational Phenotypes: Where the Theory of Computation Meets Evo-Devo by Sergio Balari, Guillermo Lorenzo

“…This article argues that the Chomsky Hierarchy can be reinterpreted as a developmental morphospace constraining the evolution of a discrete and finite series of computational phenotypes. …”
Get full text

Finite Automata with Generalized Acceptance Criteria by Timo Peichl, Heribert Vollmer

“…We study leaf languages either taken from one of the classes of the Chomsky hierarchy, or taken from a time- or space-bounded complexity class. …”
Get full text

The generative power of weighted one-sided and regular sticker systems by Gan, Yee Siang, Fong, Wan Heng, Sarmin, Nor Haniza, Turaev, Sherzod

“…Moreover, the relationship of the families of languages generated by these two variants of sticker systems to the Chomsky hierarchy is also presented.…”

The generative power of weighted one-sided and regular sticker systems by Gan, Yee Siang, Fong, Wan Heng, Sarmin, Nor Haniza, Turaev, Sherzod

“…Moreover, the relationship of the families of languages generated by these two variants of sticker systems to the Chomsky hierarchy is also presented.…”

On bonded sequential and parallel insertion systems by Holzer, Markus, Truthe, Bianca, Yosman, Ahmad Firdaus

“…We investigate the generative capacity of those two kinds and relate the families of generated languages to some families of the Chomsky hierarchy and to families of languages generated by Lindenmayer systems. …”

The generative power of weighted one-sided and regular sticker systems by Gan, Yee Siang, Fong, Wan Heng, Sarmin, Nor Haniza, Turaev, Sherzod

“…Moreover, the relationship of the families of languages generated by these two variants of sticker systems to the Chomsky hierarchy is also presented.…”
Get full text
Get full text

The generative capacity of weighted simple and semi-simple splicing systems by Fong, Wan Heng, Gan, Yee Siang, Sarmin, Nor Haniza, Turaev, Sherzod

“…In addition, the generative power of weighted simple and semi-simple splicing systems are generalised by relating their generated threshold languages to the Chomsky hierarchy.…”

Weighted simple and semi-simple splicing systems by Gan, Yee Siang, Fong, Wan Heng, Sarmin, Nor Haniza, Turaev, Sherzod

“…Lastly, relation of the languages generated by weighted simple and semi-simple splicing systems in the Chomsky hierarchy are also investigated.…”
Get full text

The properties of semi-simple splicing system over alternating group, A3 by Selvarajoo, Mathuri, Fong, Wan Heng, Sarmin, Nor Haniza, Turaev, Sherzod

“…Splicing languages generated from the splicing system are classified based on their computational power, according to the Chomsky Hierarchy. Previous researchers found that the splicing system of finite set of strings and rules generates only regular languages which has the lowest computational power. …”
Get full text