A1 Journal article – refereed
ON DOL SYSTEMS WITH IMMIGRATION




List of 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 number: 120
Issue number: 2
Number of pages: 17
ISSN: 0304-3975

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.


Internal Authors/Editors

Last updated on 2019-20-07 at 01:53