Equivalence problem for finitely iterated counter machines

DOI10.1007/BF01069603zbMath0459.68049MaRDI QIDQ3910027

L. P. Lisovik, V. N. Red'ko

Publication date: 1980

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

Turing machinescomparison of languages recognizable by deterministic counter machinesstandard circuits

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Reversal-bounded multipushdown machines
• Counter machines and counter languages

This page was built for publication: Equivalence problem for finitely iterated counter machines