๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The Equivalence Problem for DF0L Languages and Power Series

โœ Scribed by Juha Honkala


Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
158 KB
Volume
65
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

โœฆ Synopsis


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.


๐Ÿ“œ SIMILAR VOLUMES