A useful device for showing the solvability of some decision problems

Authors:
Oscar H. Ibarra;Chul E. Kim
Affiliations:
-;-
Venue:
Journal of Computer and System Sciences
Year:
1976

Citing 6
Cited 2

On Context-Free Languages

Journal of the ACM (JACM)
Formal languages and their relation to automata

Formal languages and their relation to automata
The Mathematical Theory of Context-Free Languages

The Mathematical Theory of Context-Free Languages
A Remark on Code Sets and Context-Free Languages

IEEE Transactions on Computers
On multi-head finite automata

IBM Journal of Research and Development
Parallel program schemata

Journal of Computer and System Sciences

More decidable instances of Post's correspondence problem: beyond counting

Information Processing Letters
Complexity of multi-head finite automata: Origins and directions

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We look at a restricted model of a multihead pushdown automaton and use some of its properties to show the existence of algorithms for some decision problems concerning code sets and vector addition systems.