The language equivalence problem for HD0L systems having D0L growths

Authors:
Juha Honkala
Affiliations:
Department of Mathematics, University, of Turku, FIN-20014 Turku, Finland
Venue:
Theoretical Computer Science - Insightful theory
Year:
2005

Citing 7
Cited 0

Rational series and their languages

Rational series and their languages
Simple reductions between D0L language and sequence equivalence problems

Discrete Applied Mathematics
Handbook of formal languages, vol. 1: word, language, grammar

Handbook of formal languages, vol. 1: word, language, grammar
A short solution of the HDT0L sequence equivalence problem

Theoretical Computer Science
Mathematical Theory of L Systems

Mathematical Theory of L Systems
Automata: Theoretic Aspects of Formal Power Series

Automata: Theoretic Aspects of Formal Power Series
On D0L systems with finite axiom sets

Acta Cybernetica

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that language equivalence is decidable for HD0L systems having D0L growths. By definition, an HD0L system H has D0L growth if the length sequence of H is a D0L length sequence.