Deciding freeness for program schemes with a single unary function

DOI10.1016/0020-0190(81)90118-6zbMATH Open0476.68017OpenAlexW1982142491MaRDI QIDQ1159977FDOQ1159977

Authors: Tat-Hung Chan 

Publication date: 1981

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(81)90118-6

zbMATH Keywords

decidabilitymulticounter machinescounter reversals

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Reversal-Bounded Multicounter Machines and Their Decision Problems
• The complexity of decision problems for finite-turn multicounter machines
• Theory of program structures: Schemes, semantics, verification

This page was built for publication: Deciding freeness for program schemes with a single unary function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1159977)