Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 Fundamenta Informaticae

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: Chomshy hierarchy

Sortuj według:

Ogranicz wyniki do:

On String Languages Generated by Spiking Neural P Systems

Chen H., Freund R., Ionescu M., Paun G., Pérez-Jiménez M.J.

Fundamenta Informaticae

2007

Vol. 75, nr 1-4

141-162

We continue the study of spiking neural P systems by considering these computing devices as binary string generators: the set of spike trains of halting computations of a given system constitutes the language generated by that system. Although the "direct" generative capacity of spiking neural P systems is rather restricted (some very simple languages cannot be generated in this framework), regular languages are inverse-morphic images of languages of finite spiking neural P systems, and recursively enumerable languages are projections of inverse-morphic images of languages generated by spiking neural P systems.

Block Substitutions and Their Properties

Kari L., Losseva E.

Fundamenta Informaticae

2006

Vol. 73, nr 1-2

165-178

We introduce a type of substitution operation inspired by errors occurring in biologically encoded information. We derive the closure properties of language families in the Chomsky hierarchy under these substitution operations. Moreover, we consider some language equations involving these operations and investigate decidability of the existence of solutions to such equations.