1975•DAIMI Report SeriesOpen access

The Growth Range Equivalence Problem for D0L Systems is Decidable

Jean Berstel

Abstract

The decidability of equivalence problems for DOL systems has been studied in various papers. One of the questions left open in these papers, is the decidability of what one might call the growth range equivalence problem. Two DOL systems are said to be equivalent if the ranges of their growth functions coincide. This problem is proved to be decidable. Published in: A. Lindenmayer & G. Rozenberg (ed.) Automata, Languages and Development, North-Holland, 1976.

Open-access reader

About this research paper

What this paper is about

Why it matters

OpenAlex reports 16 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Decidability, Equivalence (formal languages), Mathematics, Automaton, Discrete mathematics, Range (aeronautics), Combinatorics, Calculus (dental)