Checking sets, test sets, rich languages and commutatively closed languages
type: Item
instance of: scholarly article
title: Checking sets, test sets, rich languages and commutatively closed languages
zbMATH Open document ID: 0507.68049
DOI: 10.1016/0022-0000(83)90022-3
author: J. Albert
author: D. Wood
published in: Journal of Computer and System Sciences
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 3800950
MaRDI profile type: Publication
full work available at URL: 0022-0000(83)90022-3
OpenAlex ID: W2061705910
cites work: Q3933776
cites work: Equality Sets and Complexity Classes
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: On the decidability of homomorphism equivalence for languages
cites work: Test sets and checking words for homomorphism equivalence
cites work: Elementary homomorphisms and a solution of the DOL sequence equivalence problem
cites work: Q4089754
cites work: Q4198075
cites work: Q5592246
cites work: Q4146913
cites work: Q5678435
description: scientific article; zbMATH DE number 3800950