Restarting Automata and Their Relations to the Chomsky Hierarchy

2003 ◽  
pp. 55-74 ◽  
Author(s):  
Friedrich Otto
Keyword(s):  
Chomsky Hierarchy

scholarly journals Principles of structure building in music, language and animal song

2015 ◽  
Vol 370 (1664) ◽  
pp. 20140097 ◽  
Author(s):  
Martin Rohrmeier ◽  
Willem Zuidema ◽  
Geraint A. Wiggins ◽  
Constance Scharff
Keyword(s):  
Formal Language ◽  
Animal Communication ◽  
Structural Complexity ◽  
Language Theory ◽  
Human Language ◽  
Chomsky Hierarchy ◽  
Structure Building ◽  
Animal Vocalizations ◽  
Communicative Success ◽  
Parallel Feature

Human language, music and a variety of animal vocalizations constitute ways of sonic communication that exhibit remarkable structural complexity. While the complexities of language and possible parallels in animal communication have been discussed intensively, reflections on the complexity of music and animal song, and their comparisons, are underrepresented. In some ways, music and animal songs are more comparable to each other than to language as propositional semantics cannot be used as indicator of communicative success or wellformedness, and notions of grammaticality are less easily defined. This review brings together accounts of the principles of structure building in music and animal song. It relates them to corresponding models in formal language theory, the extended Chomsky hierarchy (CH), and their probabilistic counterparts. We further discuss common misunderstandings and shortcomings concerning the CH and suggest ways to move beyond. We discuss language, music and animal song in the context of their function and motivation and further integrate problems and issues that are less commonly addressed in the context of language, including continuous event spaces, features of sound and timbre, representation of temporality and interactions of multiple parallel feature streams. We discuss these aspects in the light of recent theoretical, cognitive, neuroscientific and modelling research in the domains of music, language and animal song.

scholarly journals REPRESENTATIONS AND CHARACTERIZATIONS OF LANGUAGES IN CHOMSKY HIERARCHY BY MEANS OF INSERTION-DELETION SYSTEMS

2008 ◽  
Vol 19 (04) ◽  
pp. 859-871 ◽  
Author(s):  
GHEORGHE PĂUN ◽  
MARIO J. PÉREZ-JIMÉNEZ ◽  
TAKASHI YOKOMORI
Keyword(s):  
Dna Computing ◽  
Research Direction ◽  
Regular Languages ◽  
Turing Computability ◽  
Chomsky Hierarchy ◽  
Recursively Enumerable ◽  
Enumerable Language ◽  
Language L ◽  
Context Free

Insertion-deletion operations are much investigated in linguistics and in DNA computing and several characterizations of Turing computability and characterizations or representations of languages in Chomsky hierarchy were obtained in this framework. In this note we contribute to this research direction with a new characterization of this type, as well as with representations of regular and context-free languages, mainly starting from context-free insertion systems of as small as possible complexity. For instance, each recursively enumerable language L can be represented in a way similar to the celebrated Chomsky-Schützenberger representation of context-free languages, i.e., in the form L = h(L(γ) ∩ D), where γ is an insertion system of weight (3, 0) (at most three symbols are inserted in a context of length zero), h is a projection, and D is a Dyck language. A similar representation can be obtained for regular languages, involving insertion systems of weight (2,0) and star languages, as well as for context-free languages – this time using insertion systems of weight (3, 0) and star languages.

Chomsky Hierarchy Control on Isotonic Array P Systems

2016 ◽  
Vol 30 (02) ◽  
pp. 1650004 ◽  
Author(s):  
Williams Sureshkumar ◽  
Raghavan Rama
Keyword(s):  
P Systems ◽  
Generative Capacity ◽  
Chomsky Hierarchy

In this paper, we propose a new regulated evolution in P systems with isotonic arrays and isotonic array rules. The regulated language will be a language of Chomsky hierarchy. This model generates interesting pictures for a given regulated language. The generative capacity is explored.

scholarly journals Evolutionary Linguistics: A New Look at an Old Landscape

2016 ◽  
Author(s):  
Marc D. Hauser ◽  
David Barner ◽  
Tim O’Donnell
Keyword(s):  
Nonhuman Primates ◽  
Language Evolution ◽  
Developmental Studies ◽  
Evolution Of Language ◽  
Language Faculty ◽  
Chomsky Hierarchy ◽  
Evolutionary Linguistics ◽  
Generative Theory ◽  
New Findings ◽  
Child Language Acquisition

This article explores the evolution of language, focusing on insightsderived from observations and experiments in animals, guided by currenttheoretical problems that were inspired by the generative theory ofgrammar, and carried forward in substantial ways to the present bypsycholinguists working on child language acquisition. We suggest that overthe past few years, there has been a shift with respect to empiricalstudies of animals targeting questions of language evolution. Inparticular, rather than focus exclusively on the ways in which animalscommunicate, either naturally or by means of artificially acquired symbolsystems, more recent work has focused on the underlying computationalmechanisms subserving the language faculty and the ability of nonhumananimals to acquire these in some form. This shift in emphasis has broughtbiologists studying animals in closer contact with linguists studying theformal aspects of language, and has opened the door to a new line ofempirical inquiry that we label evolingo. Here we review some of theexciting new findings in the evolingo area, focusing in particular onaspects of semantics and syntax.With respect to semantics, we suggest thatsome of the apparently distinctive and uniquely linguistic conceptualdistinctions may have their origins in nonlinguistic conceptualrepresentations; as one example, we present data on nonhuman primates andtheir capacity to represent a singular–plural distinction in the absence oflanguage. With respect to syntax, we focus on both statistical andrule-based problems, especially the most recent attempts to exploredifferent layers within the Chomsky hierarchy; here, we discuss work ontamarins and starlings, highlighting differences in the patterns of resultsas well as differences in methodology that speak to potential issues oflearnability. We conclude by highlighting some of the exciting questionsthat lie ahead, as well as some of the methodological challenges that faceboth comparative and developmental studies of language evolution.

How Chemistry Computes: Language Recognition by Non-Biochemical Chemical Automata

2019 ◽  
Author(s):  
Marta Dueñas-Diez ◽  
Juan Perez-Mercader
Keyword(s):  
Chemical Reaction ◽  
Reaction Network ◽  
Reaction Diffusion ◽  
Natural Computing ◽  
Precipitation Reaction ◽  
Theory Of Computation ◽  
Language Recognition ◽  
Experimental Realization ◽  
Chomsky Hierarchy ◽  
Push Down

This manuscript contains the experimental realization of one instance of each automata in the theory of computation using chemistry and not using biochemistry. All automata are implemented in a 1-pot reactor. The Finite Automaton (FA) is represented by a precipitation reaction, the 1-stack Push Down Automaton (PDA) by a pH reaction network and the Turing machine (TM) by the Belousov-Zhabotinsky chemical reaction. The computation (consisting on recognizing if chemically transcribed abstract sequences belong to appropriate languages in the Chomsky hierarchy) is carried out by a chemical reaction recognizing the molecules and their order. Once the sequence is introduced in the reactor (very much as mRNA is introduced in the ribosome) the reaction does all the recognition without any need for external not strictly chemical help from reaction/diffusion set-ups or chemical gates. The result of the computation has a straightforward thermodynamic/information theory interpretation. These results are of interest for soft-robotics, chemically self-assembled systems, chemical neural networks, artificial intelligence and of course chemical computing (i. e., computing done by chemistry at molecular scales which translates to larger scales by the power of Avogadro's number) as well as natural computing and analog/digital computing.

How Chemistry Computes: Language Recognition by Non-Biochemical Chemical Automata

2019 ◽  
Author(s):  
Marta Dueñas-Diez ◽  
Juan Perez-Mercader
Keyword(s):  
Chemical Reaction ◽  
Reaction Network ◽  
Reaction Diffusion ◽  
Natural Computing ◽  
Precipitation Reaction ◽  
Theory Of Computation ◽  
Language Recognition ◽  
Experimental Realization ◽  
Chomsky Hierarchy ◽  
Push Down

This manuscript contains the experimental realization of one instance of each automata in the theory of computation using chemistry and not using biochemistry. All automata are implemented in a 1-pot reactor. The Finite Automaton (FA) is represented by a precipitation reaction, the 1-stack Push Down Automaton (PDA) by a pH reaction network and the Turing machine (TM) by the Belousov-Zhabotinsky chemical reaction. The computation (consisting on recognizing if chemically transcribed abstract sequences belong to appropriate languages in the Chomsky hierarchy) is carried out by a chemical reaction recognizing the molecules and their order. Once the sequence is introduced in the reactor (very much as mRNA is introduced in the ribosome) the reaction does all the recognition without any need for external not strictly chemical help from reaction/diffusion set-ups or chemical gates. The result of the computation has a straightforward thermodynamic/information theory interpretation. These results are of interest for soft-robotics, chemically self-assembled systems, chemical neural networks, artificial intelligence and of course chemical computing (i. e., computing done by chemistry at molecular scales which translates to larger scales by the power of Avogadro's number) as well as natural computing and analog/digital computing.

Sign in / Sign up

Export Citation Format

Share Document