Reversal-Bounded Multicounter Machines and Their Decision Problems
Journal of the ACM1978Vol. 25(1), pp. 116–133
Citations Over TimeTop 10% of 1978 papers
Abstract
Decidable and undecldable properties of various classes of two-way multlcounter machines (deterministic, nondetermmlstlc, multttape, pushdown store augmented) with reversal-bounded input and/or counters are investigated In particular It IS shown that the emptiness, infiniteness, dlsjointness, containment, universe, and equivalence problems are decidable for the class of deterministic two-way multlcounter machines whose input and counters are reversal-bounded
Related Papers
- → PACWON: A parallelizing compiler for workstations on a network(1998)
- Study and Two Types of Typical Usage of DataGrid Web Server Control(2005)
- Achieving Parameter of DBSCAN Based on Datagrid(2010)
- Using DataGrid Control to Realize DataBase of Querying in VB6.0(2000)
- Susquehanna Chorale Spring Concert "Roots and Wings"(2017)