The language equivalence problem for HD0L systems having D0L growths
type: Item
instance of: scholarly article
title: The language equivalence problem for HD0L systems having D0L growths
zbMATH Open document ID: 1078.68086
author: Juha Honkala
published in: Theoretical Computer Science
publication date: 2005-02-22T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 2136566
zbMATH Keywords: D0L system
zbMATH Keywords: HD0L system
zbMATH Keywords: Language equivalence problem
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.09.014
OpenAlex ID: W1982408059
cites work: Q3994777
cites work: The decidability of the equivalence problem for DOL-systems
cites work: Q3711770
cites work: Elementary homomorphisms and a solution of the DOL sequence equivalence problem
cites work: A short solution for the HDT0L sequence equivalence problem
cites work: The equivalence problem for DF0L languages and power series.
cites work: Q4439450
cites work: Q3395969
cites work: On the Images of ℕ-Rational Sequences Counting Multiplicities
cites work: On the decidability of some equivalence problems for DOL-systems
cites work: The equivalence problem for deterministic TOL-systems is undecidable
cites work: Q4140407
cites work: Q4714446
cites work: On the decidability of the OL-DOL equivalence problem
cites work: The decidability of the FOL-DOL equivalence problem
cites work: Q3865508
cites work: Q3930656
cites work: The decidability of the DOL-DTOL equivalence problem
cites work: Q3753495
cites work: On sentential forms of context-free grammars
cites work: Simple reductions between \(D0L\) language and sequence equivalence problems
cites work: Q4155837
DOI: 10.1016/J.TCS.2004.09.014
description: scientific article; zbMATH DE number 2136566