Title of article
Dense-choice Counter Machines revisited
Author/Authors
Florent Bouchy، نويسنده , , Alain Finkel، نويسنده , , Pierluigi San Pietro، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
20
From page
3
To page
22
Abstract
his paper clarifies the picture about Dense-choice Counter Machines, which have been less studied than (discrete) Counter Machines. We revisit the definition of "Dense Counter Machines" so that it now extends (discrete) Counter Machines, and we provide new undecidability and decidability results. Using the first-order additive mixed theory of reals and integers, we give a logical characterization of the sets of configurations reachable by reversal-bounded Dense-choice Counter Machines.
Journal title
Electronic Proceedings in Theoretical Computer Science
Serial Year
2009
Journal title
Electronic Proceedings in Theoretical Computer Science
Record number
679758
Link To Document