The Equivalence Problem for DF0L Languages and Power Series

作者：

Highlights：

•

摘要

We show that equivalence is decidable for D0L systems with finite axiom sets. We discuss also DF0L power series and solve their equivalence problem over computable fields.

论文关键词：D0L systems,D0L systems with finite axiom sets,equivalence problem.

论文评审过程：Author links open overlay panelJuhaHonkala1

论文官网地址：https://doi.org/10.1006/jcss.2002.1850