Reversal-bounded multicounter ?-machines

DOI10.1007/BF01132080MaRDI QIDQ3830987zbMATH OpenFDO

Authors L. P. Lisovik

Publication date 1988

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01132080

zbMATH Keywords

algorithmic properties of \(\Sigma\)-machinesdeterministic convertersreversal-bounded countersolvability of the emptiness problemsolvable singular second-order theories

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Turing machines and related notions (03D10) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 3974295
• An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines
• Reversal-Bounded Counter Machines Revisited
• Automata with Reversal-Bounded Counters: A Survey
• Counter machines and verification problems.

Cites work

• Construction of decidable singular theories of two successor functions with an extra predicate
• Reversal-Bounded Multicounter Machines and Their Decision Problems

Cited in

(3)

• Reversal-Bounded Counter Machines Revisited
• Automata with Reversal-Bounded Counters: A Survey
• Unboundedness problems for machines with reversal-bounded counters

This page was built for publication: Reversal-bounded multicounter ?-machines

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