On two-way nondeterministic finite automata with one reversal-bounded counter
type: Item
instance of: scholarly article
title: On two-way nondeterministic finite automata with one reversal-bounded counter
zbMATH Open document ID: 1078.68080
author: Zhe Dang
author: Oscar H. Ibarra
author: Zhi-Wei Sun
published in: Theoretical Computer Science
publication date: 2005-02-22T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 2136562
zbMATH Keywords: Counter machine
zbMATH Keywords: Reversal-boundedness
zbMATH Keywords: Emptiness problem
zbMATH Keywords: Bounded language
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.09.010
OpenAlex ID: W2121428680
cites work: On a Problem of Partitions
cites work: Semigroups, Presburger formulas, and languages
cites work: The complexity of decision problems for finite-turn multicounter machines
cites work: Two-Way Counter Machines and Diophantine Equations
cites work: Reversal-Bounded Multicounter Machines and Their Decision Problems
cites work: On two-way FA with monotonic counters and quadratic Diophantine equations
cites work: New Decidability Results Concerning Two-Way Counter Machines
cites work: Lattice translates of a polytope and the Frobenius problem
cites work: The Diophantine Problem for Addition and Divisibility
cites work: On the Chinese Remainder Theorem
cites work: Q3992465
cites work: Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines
cites work: Complexity of the Frobenius problem
DOI: 10.1016/J.TCS.2004.09.010
description: scientific article; zbMATH DE number 2136562