Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

IJFCS
2008

favoriteEmaildiscussreport

102views more IJFCS 2008»

On Stateless Automata and P Systems

13 years 4 months ago

On Stateless Automata and P Systems

Download www.eecs.wsu.edu

We introduce the notion of stateless multihead two-way (respectively, oneway) NFAs and stateless multicounter systems and relate them to P systems and vector addition systems. In particular, we investigate the decidability of the emptiness and reachability problems for these stateless automata and show that the results are applicable to similar questions concerning certain variants of P systems, namely, token systems and sequential tissue-like P systems.

Linmin Yang, Zhe Dang, Oscar H. Ibarra

Real-time Traffic

IJFCS 2008 | Stateless Multicounter Systems | Systems | Vector Addition Systems |

claim paper

Related Content

» P Systems and Finite Automata

» Model Checking Probabilistic Pushdown Automata

» Analytic realtime analysis and timed automata a hybrid method for analyzing embedded realt...

» A Stateless Traceback Technique for Identifying the Origin of Attacks from a Single Packet

» Towards Stateless SinglePacket IP Traceback

» P systems with symportantiport simulating counter automata

» Transforming BPEL into Annotated Deterministic Finite State Automata for Service Discovery

» Modeling the Dynamics of HIV Infection with ConformonP Systems and Cellular Automata

» On Three Classes of AutomataLike P Systems

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2008
Where	IJFCS
Authors	Linmin Yang, Zhe Dang, Oscar H. Ibarra

Comments (0)