A1 Refereed original research article in a scientific journal
ON DOL SYSTEMS WITH IMMIGRATION
Authors: HONKALA J
Publisher: ELSEVIER SCIENCE BV
Publication year: 1993
Journal: Theoretical Computer Science
Journal name in source: THEORETICAL COMPUTER SCIENCE
Journal acronym: THEOR COMPUT SCI
Volume: 120
Issue: 2
First page : 229
Last page: 245
Number of pages: 17
ISSN: 0304-3975
DOI: https://doi.org/10.1016/0304-3975(93)90289-6
Abstract
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.
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.
UTU Research Portal