ON GENERALIZED DT0L SYSTEMS AND THEIR FIXED-POINTS




HONKALA J

PublisherELSEVIER SCIENCE BV

1994

Theoretical Computer Science

THEORETICAL COMPUTER SCIENCE

THEOR COMPUT SCI

127

2

269

286

18

0304-3975

DOIhttps://doi.org/10.1016/0304-3975(94)90043-4



We study a generalization of DT0L systems obtained by considering noncommutative polynomials together with mappings attaching a morphism to each variable. We call the least fixed points of such pairs generalized DT0L languages and study their basic properties.



Last updated on 2024-26-11 at 22:24