Reachability in Higher-Order-Counters

DOI10.1007/978-3-642-40313-2_47zbMath1400.68104arXiv1306.1069OpenAlexW1551487751MaRDI QIDQ2849940

Alexander Heußner, Alexander Kartzow

Publication date: 20 September 2013

Published in: Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.1069

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (1)

Unnamed Item

This page was built for publication: Reachability in Higher-Order-Counters