Nine Universal Circular Post Machines
We consider a new kind of computational device like Turing machine, so-called circular Post machines with a circular tape and moving in one direction only, introduced recently by the second and the third authors. Using 2-tag systems we construct new nine small universal machines of this kind.
Main Authors: | Artiom Alhazov, Manfred Kudlek, Yurii Rogozhin |
---|---|
Format: | Article |
Language: | English |
Published: |
Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova
2002-11-01
|
Series: | Computer Science Journal of Moldova |
Online Access: | http://www.math.md/nrofdownloads.php?file=/files/csjm/v10-n3/v10-n3-(pp247-262).pdf |
Similar Items
-
Small Universal Circular Post Machines
by: Manfred Kudlek, et al.
Published: (2001-05-01) -
Generating Languages by P Systems with Minimal Symport/Antiport
by: Artiom Alhazov, et al.
Published: (2006-12-01) -
About Precise Characterization of Languages Generated by Hybrid Networks of Evolutionary Processors with One Node
by: Artiom Alhazov, et al.
Published: (2008-11-01) -
Membrane Systems Languages Are Polynomial-Time Parsable
by: Artiom Alhazov, et al.
Published: (2010-11-01) -
Modelling Inflections in Romanian Language by P Systems with String Replication
by: Artiom Alhazov, et al.
Published: (2009-12-01)