A note on Parikh maps, abstract languages, and decision problems
References (22)
One-way finite visit automata
Theor. Comput. Sci.
(1978)- et al.
The complexity of decision problems for finite-turn multicounter machines
J. Comput. Syst. Sci.
(1981) 2DST mappings on languages and related problems
Theor. Comput. Sci.
(1982)Simple matrix languages
Infor. and Control
(1970)Controlled pushdown automata
Infor. Sci.
(1973)Absolutely parallel grammars and two-way finite state transducers
J. Comput. Syst. Sci.
(1972)Finite-turn checking automata
J. Comput. Syst. Sci.
(1971)- et al.
On Parikh maps, abstract languages and decision problems
Three models for the description of language
IRE Transactions on Information Theory
(1956)- et al.
Bounded algol-like languages
Trans. Amer. Math. Soc.
(1964)
Two-way counter machines and Diophantine equations
J. ACM
(1982)
Cited by (0)
Copyright © 1985 Published by Elsevier Inc.