Author： Freund Rudolf
Publisher： Springer Publishing Company
E-ISSN： 1614-7456|8|2|186-189
ISSN： 1433-5298
Source： Artificial Life and Robotics, Vol.8, Iss.2, 2004-11, pp. : 186-189
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
On the Computational Complexity of P Automata
By Csuhaj-Varjú Erzsébet Ibarra Oscar Vaszil György
Natural Computing, Vol. 5, Iss. 2, 2006-05 ,pp. :
Access to resources
Recommend
P systems with symport/antiport simulating counter automata
By Frisco Pierluigi Hoogeboom Hendrik
Acta Informatica, Vol. 41, Iss. 2-3, 2004-12 ,pp. :
By Carton O.
Theoretical Computer Science, Vol. 161, Iss. 1, 1996-07 ,pp. :
Mathematics in Computer Science, Vol. 1, Iss. 4, 2008-06 ,pp. :
Stable trace automata vs. full trace automata
By Schmitt V.
Theoretical Computer Science, Vol. 200, Iss. 1, 1998-06 ,pp. :