A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Filters
On the boundaries of solvability and unsolvability in tag systems. Theoretical and Experimental Results
2009
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
Other Versions
Emphasis will be put on the significance of computer experiments in research on very small tag systems. ...
Several older and more recent results on the boundaries of solvability and unsolvability in tag systems are surveyed. ...
Given two sets of periodic words [P 1 ] and [P 2 ] with period p 1 resp. p 2 . ...
doi:10.4204/eptcs.1.5
fatcat:24uwzlcbcfeu5chvcmdl2jkrke
On the complex behavior of simple tag systems—An experimental approach
2011
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
These results are combined with some theoretical results on tag systems in order to gain more insight into the computational power of simple tag systems. ...
After a discussion of some of the main theoretical results on tag systems, several results from a computer-assisted and experimental study on tag systems are analyzed. ...
Acknowledgement Part of this research was done during a research stay at the Boole centre for research in informatics, Cork university College. ...
doi:10.1016/j.tcs.2010.08.026
fatcat:g7yhicvzrjfptixzkqrep55ky4
The Complexity of Small Universal Turing Machines: A Survey
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We survey some work concerned with small universal Turing machines, cellular automata, tag systems, and other simple models of computation. ...
We also review a large number of old and new universal program size results, including new small universal Turing machines and new weakly, and semi-weakly, universal Turing machines. ...
An earlier version [89] of this work was presented at CiE 2007. We also thank Manfred Kudlek for providing literature. ...
doi:10.1007/978-3-642-27660-6_32
fatcat:iqm5dzmdpnfvdkqc2cxm2m5gem
The complexity of small universal Turing machines: A survey
2009
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We survey some work concerned with small universal Turing machines, cellular automata, tag systems, and other simple models of computation. ...
We also review a large number of old and new universal program size results, including new small universal Turing machines and new weakly, and semi-weakly, universal Turing machines. ...
An earlier version [89] of this work was presented at CiE 2007. We also thank Manfred Kudlek for providing literature. ...
doi:10.1016/j.tcs.2008.09.051
fatcat:uron5m7iezhxvelbf5cfl3ykq4
Tag Systems and the Complexity of Simple Programs
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We also recall a recent result where the halting problem for tag systems with only 2 symbols (the minimum possible) is proved undecidable. ...
In this mini-survey we discuss time complexity and program size results for universal Turing machines, tag systems, cellular automata, and other simple models of computation. ...
Tag systems were introduced by Post [30, 31] and proved universal by Minsky [19] . Soon after this Cocke and Minksy [3] proved 2-tag systems (tag systems with deletion number 2) universal. ...
doi:10.1007/978-3-662-47221-7_2
fatcat:2xume6iydrhdvpqwiqf3dlt6sy
P systems based on tag operations
2012
Computer Science Journal of Moldova
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this article we introduce P systems using Post's tag operation on strings.We show that the computational completeness can be achieved even if the deletion length is equal to one. ...
Corollary 1 There exists a universal 1-tag P system with 73 instructions. Proof. Consider the universal CPM0 from [2] . It has 6 states and 6 symbols. ...
By applying Theorem 1 to this machine we obtain a universal 1-tag P system with 73 rules.
Conclusion In this article we considered the tag operation in the context of P systems. ...
doaj:6e9d8f2417ce4c3c9ee58e29fe328205
fatcat:6t5cm7ong5g3hgronvrjb4zqxy
The Efficient BackFi Transmission Design in Ambient Backscatter Communication Systems for IoT
2019
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
design with energy harvesting of massive smart multi-hop electronic tags/sensors was investigated in the ambient backscatter communication systems. ...
to the sensing status without sending, and then, the new defined frame "Multi-RTS" may send the trigger signal to massive tags or sensors with its frame field as "M-RTS" strategy, compressed bitmap, tags ...
SYSTEM MODEL The system model of large scale Tag/Sensor node of IoT based on Wi-Fi architecture can be seen as Fig.2 , it can be mentioned that if there is no tag/sensor nodes in the coverage range of ...
doi:10.1109/access.2019.2899001
fatcat:hokd7rydcfanzas2gttj7xyv74
The complexity of small universal Turing machines: a survey
[article]
2011
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
We survey some work concerned with small universal Turing machines, cellular automata, tag systems, and other simple models of computation. ...
We finish the survey with results on generalised and restricted Turing machine models including machines with a periodic background on the tape (instead of a blank symbol), multiple tapes, multiple dimensions ...
Minsky [52, 53] showed that tag systems are universal with deletion number 6. Cocke and Minsky lowered the deletion number to 2, by showing that 2-tag systems were universal. ...
arXiv:1110.2230v1
fatcat:nuybqsyyvzcvposmcnymlrfy3y
MIXNET for Radio Frequency Identification
2007
2007 IEEE Region 5 Technical Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
Using existing techniques to implement an asymmetric cryptosystem with universal re-encryption in a MIXNET, we examine the ramifications of building such a system and also simulate its behavior with a ...
Privacy concerns have been raised with current and forthcoming implementations of RFID tags. The two main concerns are tracking and inventorying. ...
) barcode identification system [2] . ...
doi:10.1109/tpsd.2007.4380339
fatcat:ikz6z6coqfavhf2vgfkfm35rgi
Nine switch-affine neurons suffice for Turing universality
1999
Neural Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Here we focus on a type of high-order neurons called switch-affine neurons, with piecewise-linear activation functions, and prove that nine such neurons suffice for simulating universal Turing machines ...
Siegelmann and Sontag (1991) showed the universality of homogeneous networks of first-order neurons having piecewise-linear activation functions. ...
Acknowledgements This work was funded by Metz University, Institute of Technology, and partially supported by The Binational US/ Israel Foundation, The Fund for Promotion of Research at the Technion, and ...
doi:10.1016/s0893-6080(99)00025-8
pmid:12662670
fatcat:gqmxp6lw5vbsnna5aolaqmkx5m
Merged bilingual trees based on Universal Dependencies in Machine Translation
2016
Proceedings of the First Conference on Machine Translation: Volume 2, Shared Task Papers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present our new experimental system of merging dependency representations of two parallel sentences into one dependency tree. ...
We use Universal Dependencies annotation style, in which the function words, whose usage often differs between languages, are annotated as leaves. ...
Acknowledgments This work was supported by the grant 14-06548P of the Czech Science Foundation and the 7th Framework Programme of the EU grant QTLeap (No. 610516). ...
doi:10.18653/v1/w16-2318
dblp:conf/wmt/Marecek16
fatcat:hlpqhkr2ljanlatg5bptzaitlq
EPC-based Efficient Tag Selection in RFID systems
2020
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Tag-selection problem, which selects a set of wanted tags from a tag population, is vital for boosting efficiencies of the real-time applications in RFID systems. ...
INDEX TERMS RFID systems, tag selection, lower bound of communication overhead, EPC. 20546 This work is licensed under a Creative Commons Attribution 4.0 License. ...
To this end, we study the efficient tag-selection problem in RFID systems with universal applicability and a small communication time. ...
doi:10.1109/access.2020.2969188
fatcat:d7rt2anlcvhv7opzxe7zb4byhi
Analysis of Mutual Couple Effect of UHF RFID Antenna for the Internet of Things Environment
2019
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
For dense tag systems, the error was less than 9.8% when the number of tags was greater than 7, and the prediction accuracy was higher than the superposition method. ...
in predicting the mutual coupling effect, such as system frequency shift. ...
Therefore, the tag antenna obtained the coupling power P 01t : P 01t = R t R l · P 01l ≈ R t R l · P 01c = U 2 P 32R sr R r R l × · wM (1 + (wM ) 2 4R r R t ) −1 2 (3) For micro-strip tags, the antenna ...
doi:10.1109/access.2019.2923661
fatcat:5jgmx74qaffdjlw774g6r5ofxu
Small Weakly Universal Turing Machines
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
These machines simulate our new variant of tag system, the bi-tag system, and are the smallest known universal Turing machines with 5, 4, 3 and 2-symbols respectively. ...
110
P-completeness of Rule 110
P-completeness of Rule 110
P-completeness of Rule 110
P-completeness of Rule 110
P-completeness of Rule 110
Tag systems
Tag systems ...
To see this, compare the part of the Turing machine tape in bold with cells −7 to 0 of configuration c 1 in Figure 7 .2.1. We continue our simulation to give timestep c 1 ⊢ c 2 . ...
doi:10.1007/978-3-642-03409-1_24
fatcat:qm5hhofbxzbllbgbwlm32td3ny
Screw relaxing detection with UHF RFID tag
2020
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Finally, parameters such as maximum detection surface and minimum detection time are evaluated for completing the analysis of the presented detection system. ...
Three tag-sensors are designed and manufactured to comply with metallic or non-metallic application surfaces and to work within the UHF RFID Chinese band 920.5 -924.5 MHz, showing a reliable discrimination ...
FIGURE 1 . 1 Block scheme of the proposed UHF RFID system.
FIGURE 2 . 2 Well-tightened and relaxed screw on a dielectric substrate with electrical lines. ...
doi:10.1109/access.2020.2986891
fatcat:d7pdkwyiojhjnnit5juyy7fnqi
« Previous
Showing results 1 — 15 out of 503,832 results