Test sets for morphisms with bounded delay
type: Item
instance of: scholarly article
title: Test sets for morphisms with bounded delay
zbMATH Open document ID: 0579.68045
DOI: 10.1016/0166-218X(85)90063-0
author: Christian Choffrut
author: Juhani Karhumäki
published in: Discrete Applied Mathematics
publication date: 1985-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 3928364
zbMATH Keywords: Ehrenfeucht Conjecture
zbMATH Keywords: deciphering delay
MaRDI profile type: Publication
cites work: Test sets for context free languages and algebraic systems of equations over a free monoid
cites work: Q3334093
cites work: Systems of equations over a free monoid and Ehrenfeucht's conjecture
cites work: Q3901701
cites work: On the decidability of homomorphism equivalence for languages
cites work: Test sets and checking words for homomorphism equivalence
cites work: On binary equality sets and a solution to the test set conjecture in the binary case
cites work: The (generalized) Post correspondence problem with lists consisting of two words is decidable
cites work: Q4198075
cites work: Q3862379
cites work: Q3853827
cites work: Q5610821
cites work: Q4140407
cites work: Q3948608
description: scientific article; zbMATH DE number 3928364