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. Leibniz International Proceedings in Informatics (LIPIcs), 649-661.

Statistics

Citations

Dimensions.ai Metrics
11 citations in Web of Science®
20 citations in Scopus®
Google Scholar™

Altmetrics

Downloads

19 downloads since deposited on 04 Feb 2016
0 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:17 Oct 2021 06:35
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
  • Content: Published Version
  • Language: English
  • Licence: Creative Commons: Attribution 4.0 International (CC BY 4.0)