Header

UZH-Logo

Maintenance Infos

Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words


Neary, T (2015). Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words. In: The 32nd Symposium on Theoretical Aspects of Computer Science (STACS 2015), Munich, 4 March 2015 - 7 March 2015, 649-661.

Statistics

Citations

Dimensions.ai Metrics
7 citations in Web of Science®
13 citations in Scopus®
5 citations in Microsoft Academic
Google Scholar™

Altmetrics

Downloads

13 downloads since deposited on 04 Feb 2016
3 downloads since 12 months
Detailed statistics

Additional indexing

Item Type:Conference or Workshop Item (Speech), refereed, original work
Communities & Collections:07 Faculty of Science > Institute of Neuroinformatics
Dewey Decimal Classification:570 Life sciences; biology
Scopus Subject Areas:Physical Sciences > Software
Language:English
Event End Date:7 March 2015
Deposited On:04 Feb 2016 10:08
Last Modified:30 Jul 2020 21:18
Publisher:Leibniz International Proceedings in Informatics (LIPIcs)
Series Name:32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015
Number of Pages:13
OA Status:Green
Publisher DOI:https://doi.org/10.4230/LIPIcs.STACS.2015.649

Download

Green Open Access

Download PDF  'Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words'.
Preview
Content: Published Version
Language: English
Filetype: PDF
Size: 636kB
View at publisher
Licence: Creative Commons: Attribution 4.0 International (CC BY 4.0)