The Sequence Equivalence Problem for Marked DT0L Systems

Authors:
Juha Honkala
Affiliations:
(Correspd.) Department of Mathematics, University of Turku, FI-20014 Turku, Finland. juha.honkala@utu.fi
Venue:
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Year:
2011

Citing 4
Cited 0

Rational series and their languages

Rational series and their languages
A short solution of the HDT0L sequence equivalence problem

Theoretical Computer Science
Handbook of Formal Languages

Handbook of Formal Languages
Mathematical Theory of L Systems

Mathematical Theory of L Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the DT0L sequence equivalence problem for marked morphisms. We show that to decide this problem it is enough to consider initial terms involving at most 2n morphisms where n is the cardinality of the underlying alphabet.