Sciweavers

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

10

MCU
2007

favoriteEmaildiscussreport

123views Hardware» more MCU 2007»

Study of Limits of Solvability in Tag Systems

13 years 6 months ago

Study of Limits of Solvability in Tag Systems

Download logica.ugent.be

Abstract. In this paper we will give an outline of the proof of the solvability of the halting and reachability problem for 2-symbolic tag systems with a deletion number v = 2. This result will be situated in a more general context of research on limits of solvability in tag systems. Key words: Tag Systems, Limits of solvability, Reachability problem, Halting Problem

Liesbeth De Mol

Real-time Traffic

2-symbolic Tag Systems | Hardware | MCU 2007 | Reachability Problem | Tag Systems |

claim paper

Related Content

» TagReel A Visualization of Tag Relations among User Interests in the Social Tagging System

» Two Birds One Stone Selecting Functionally Informative Tag SNPs for Disease Association St...

» An analytical study of GWAPbased geospatial tagging systems

» Toward Acoustic Models for Languages with Limited Linguistic Resources

» Collective User Behaviour and Tag Contextualisation in Folksonomies

» Tag Loss Probability Evaluation for a Continuous Flow of Tags in the EPCGlobal Standard

» Similarity crossanalysis of tag cotag spaces in social classification systems

» Longitudinal study of a buildingscale RFID ecosystem

» A Mobile Product Recommendation System Interacting with Tagged Products

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2007
Where	MCU
Authors	Liesbeth De Mol

Comments (0)