Regular ω-Languages Defined by Finite Extended Spiking Neural P Systems

Authors:
Rudolf Freund;Marion Oswald
Affiliations:
Faculty of Informatics, Institute of Computer Languages Vienna University of Technology Favoritenstraß/e 9, A-1040 Wien, Austria. E-mails: rudi@emcc.at/ marion@emcc.at;Faculty of Informatics, Institute of Computer Languages Vienna University of Technology Favoritenstraß/e 9, A-1040 Wien, Austria. E-mails: rudi@emcc.at/ marion@emcc.at
Venue:
Fundamenta Informaticae
Year:
2008

Citing 9
Cited 1

X-automata on &ohgr;-words

Theoretical Computer Science
&ohgr;-languages

Handbook of formal languages, vol. 3
Computing with membranes

Journal of Computer and System Sciences
Handbook of Formal Languages

Handbook of Formal Languages
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory
Membrane Computing: An Introduction

Membrane Computing: An Introduction
P Automata or Purely Communicating Accepting P Systems

WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Spiking Neural P Systems

Fundamenta Informaticae
Extended spiking neural p systems

WMC'06 Proceedings of the 7th international conference on Membrane Computing

Bibliography of spiking neural P systems

Natural Computing: an international journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate finite extended spiking neural P systems as acceptors for infinite sequences of symbols 1 and 0, i.e., of ω-words over {0, 1}. We show that regular ω-languages over {0, 1} can be characterized by deterministic/non-deterministic finite extended spiking neural P systems accepting ω-words in specific modes with respect to the infinite sequence of states the finite extended spiking neural P systems go through during the accepting computations.