scientific article; zbMATH DE number 3974295

MaRDI QIDQ3740236zbMATH OpenFDO

Authors Rodney R. Howell, Louis E. Rosier

Publication date 1986

zbMATH Keywords

complete problemscontainment problemcounter automatadisjointness problemefficient nondeterministic algorithmequivalence problemsystems of communicating finite-state machines

Mathematics Subject Classification ID

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

Recommendations

• An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines
• Counter machines and verification problems.
• Counter machines: Decidable properties and applications to verification problems
• New Decidability Results Concerning Two-Way Counter Machines
• New decidability results concerning two-way counter machines and applications

Cited in

(6)

• An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines
• Reversal-bounded multicounter ?-machines
• On the emptiness problem for two-way NFA with one reversal-bounded counter
• Reachability analysis for some models of infinite-state transition systems
• On reachability and safety in infinite-state systems
• Unboundedness problems for machines with reversal-bounded counters

This page was built for publication:

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