A new bound for the D0L language equivalence problem
type: Item
instance of: scholarly article
title: A new bound for the D0L language equivalence problem
zbMATH Open document ID: 1386.68092
author: Juha Honkala
published in: Acta Informatica
publication date: 2018-02-28T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q70
zbMATH DE Number: 6844723
MaRDI profile type: Publication
full work available at URL: s00236-016-0286-x
OpenAlex ID: W2550759788
cites work: Bounds for the D0L language equivalence problem
cites work: A new bound for the D0L sequence equivalence problem
cites work: On the decidability of some equivalence problems for DOL-systems
cites work: Q4746787
cites work: Q4714446
cites work: Simple reductions between \(D0L\) language and sequence equivalence problems
DOI: 10.1007/S00236-016-0286-X
description: scientific article; zbMATH DE number 6844723