The equivalence problem of polynomially bounded D0L systems -- a bound depending only on the size of the alphabet
type: Item
instance of: scholarly article
title: The equivalence problem of polynomially bounded D0L systems -- a bound depending only on the size of the alphabet
zbMATH Open document ID: 1039.68067
author: Juha Honkala
published in: Theory of Computing Systems
publication date: 2003-08-26T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1971500
zbMATH Keywords: sequence equivalence problem
MaRDI profile type: Publication
full work available at URL: s00224-002-1075-1
OpenAlex ID: W2067341065
DOI: 10.1007/S00224-002-1075-1
description: scientific article; zbMATH DE number 1971500