On binary equality sets and a solution to the test set conjecture in the binary case
type: Item
instance of: scholarly article
title: On binary equality sets and a solution to the test set conjecture in the binary case
zbMATH Open document ID: 0523.68066
DOI: 10.1016/0021-8693(83)90119-9
author: Juhani Karhumäki
author: Andrzej Ehrenfeucht
author: Grzegorz Rozenberg
published in: Journal of Algebra
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 20M35
Mathematics Subject Classification ID: 20M05
zbMATH DE Number: 3829282
zbMATH Keywords: test set conjecture
zbMATH Keywords: equality set
zbMATH Keywords: injective morphisms
zbMATH Keywords: binary alphabet
Wikidata QID: Q122958005
MaRDI profile type: Publication
full work available at URL: 0021-8693(83)90119-9
OpenAlex ID: W2043837664
cites work: Test sets for context free languages and algebraic systems of equations over a free monoid
cites work: A Purely Homomorphic Characterization of Recursively Enumerable Sets
cites work: The decidability of the equivalence problem for DOL-systems
cites work: Q3901701
cites work: Systems of equations over a free monoid and Ehrenfeucht's conjecture
cites work: Test sets and checking words for homomorphism equivalence
cites work: The (generalized) Post correspondence problem with lists consisting of two words is decidable
cites work: Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
cites work: Q4198075
cites work: A variant of a recursively unsolvable problem
cites work: Q4140407
cites work: Q4194484
cites work: Q4155837
description: scientific article; zbMATH DE number 3829282