ON DOL SYSTEMS WITH IMMIGRATION



: HONKALA J

Publisher: ELSEVIER SCIENCE BV

: 1993

: Theoretical Computer Science

: THEORETICAL COMPUTER SCIENCE

: THEOR COMPUT SCI

: 120

: 2

: 229

: 245

: 17

: 0304-3975

DOI: https://doi.org/10.1016/0304-3975(93)90289-6


We study DOL systems with immigration. We show that sequence and growth equivalence are decidable. We establish regularity and decidability results concerning degrees of ambiguity. As a consequence of results about subword complexity, we show that regularity and omega-regularity are decidable for languages generated by growing systems.



Last updated on 2024-26-11 at 14:46