English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Unboundedness Problems for Machines with Reversal-Bounded Counters

MPS-Authors
/persons/resource/persons274580

Baumann,  Pascal
Group G. Zetzsche, Max Planck Institute for Software Systems, Max Planck Society;

/persons/resource/persons266088

Ganardi,  Moses
Group G. Zetzsche, Max Planck Institute for Software Systems, Max Planck Society;

/persons/resource/persons276235

Schütze,  Lia
Group G. Zetzsche, Max Planck Institute for Software Systems, Max Planck Society;

/persons/resource/persons230970

Zetzsche,  Georg
Group G. Zetzsche, Max Planck Institute for Software Systems, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

978-3-031-30829-1_12.pdf
(Publisher version), 577KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Baumann, P., D’Alessandro, F., Ganardi, M., Ibarra, O., McQuillan, I., Schütze, L., et al. (2023). Unboundedness Problems for Machines with Reversal-Bounded Counters. In O. Kupferman, & P. Sobocinski (Eds.), Foundations of Software Science and Computation Structures (pp. 240-264). Berlin: Springer. doi:10.1007/978-3-031-30829-1_12.


Cite as: https://hdl.handle.net/21.11116/0000-000D-0DC6-6
Abstract
There is no abstract available