A new bound for the D0L sequence equivalence problem
type: Item
instance of: scholarly article
title: A new bound for the D0L sequence equivalence problem
zbMATH Open document ID: 1106.68060
author: Juha Honkala
published in: Acta Informatica
publication date: 2007-01-05T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5081848
MaRDI profile type: Publication
full work available at URL: s00236-006-0028-6
OpenAlex ID: W1980241523
cites work: The decidability of the equivalence problem for DOL-systems
cites work: Elementary homomorphisms and a solution of the DOL sequence equivalence problem
cites work: On a bound for the DOL sequence equivalence problem
cites work: A short solution for the HDT0L sequence equivalence problem
cites work: The equivalence problem of polynomially bounded D0L systems -- a bound depending only on the size of the alphabet
cites work: An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet
cites work: On the equivalence problem for binary DOL systems
cites work: Q4746787
cites work: Q4714446
cites work: Q3753495
cites work: Explicit test sets for iterated morphisms in free monoids and metabelian groups
DOI: 10.1007/S00236-006-0028-6
description: scientific article; zbMATH DE number 5081848