𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On D0L power series

✍ Scribed by Juha Honkala

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
134 KB
Volume
244
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

✦ Synopsis

We study D0L power series. We show how elementary morphisms introduced by Ehrenfeucht and Rozenberg can be used in connection with power series, characterize the sequences of rational numbers and integers which can appear as coe cients in D0L power series and establish various decidability results.

πŸ“œ SIMILAR VOLUMES

On images of D0L and DT0L power series
On images of D0L and DT0L power series
✍ Juha Honkala πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 151 KB

The D0L and DT0L power series are generalizations of D0L and DT0L languages. We continue the study of these series by investigating various decidability questions concerning the images of D0L and DT0L power series.

Watson–Crick D0L systems: the power of o
Watson–Crick D0L systems: the power of one transition
✍ Arto Salomaa; Petr SosΔ±́k πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 254 KB

We investigate the class of functions computable by uni-transitional Watson-Crick D0L systems: only one complementarity transition is possible during each derivation. The class is characterized in terms of a certain min-operation applied to Z-rational functions. We also exhibit functions outside the

The Equivalence Problem for DF0L Languag
The Equivalence Problem for DF0L Languages and Power Series
✍ Juha Honkala πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 158 KB

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.

Periodic D0L languages
Periodic D0L languages
✍ Tom Head; Barbara Lando πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 409 KB