2DST mappings of languages and related problems
type: Item
instance of: scholarly article
title: 2DST mappings of languages and related problems
zbMATH Open document ID: 0485.68072
DOI: 10.1016/0304-3975(82)90061-5
author: Oscar H. Ibarra
published in: Theoretical Computer Science
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 3763323
zbMATH Keywords: family of languages effectively closed under inverse homomorphism and intersection with regular sets
zbMATH Keywords: effectively constructible semilinear Parikh maps
zbMATH Keywords: one-way nondeterministic multicounter machine
zbMATH Keywords: two-way deterministic sequential transducers
describes a project that uses: ALGOL 60
MaRDI profile type: Publication
full work available at URL: 0304-3975(82)90061-5
OpenAlex ID: W2080256878
cites work: Reversal-bounded multipushdown machines
cites work: Equality Sets and Complexity Classes
cites work: A Purely Homomorphic Characterization of Recursively Enumerable Sets
cites work: Some decidability results about regular and pushdown translations
cites work: A homomorphic characterization of time and space complexity classes of languages†
cites work: Homomorphism equivalence on etol languages†
cites work: On the decidability of homomorphism equivalence for languages
cites work: Test sets and checking words for homomorphism equivalence
cites work: Bounded Algol-Like Languages
cites work: AFL with the semilinear property
cites work: Checking automata and one-way stack languages
cites work: One way finite visit automata
cites work: A Remark on Code Sets and Context-Free Languages
cites work: The complexity of decision problems for finite-turn multicounter machines
cites work: Reversal-Bounded Multicounter Machines and Their Decision Problems
cites work: Simple matrix languages
cites work: Controlled pushdown automata
cites work: Multi-tape and multi-head pushdown automata
cites work: A useful device for showing the solvability of some decision problems
cites work: A hierarchy between context-free and context-sensitive languages
cites work: Q5613949
cites work: Absolutely parallel grammars and two-way finite-state transducers
cites work: Programmed Grammars and Classes of Formal Languages
cites work: Q4194484
cites work: Finite-turn checking automata
description: scientific article; zbMATH DE number 3763323