Adherences of DOL languages
type: Item
instance of: scholarly article
title: Adherences of DOL languages
zbMATH Open document ID: 0587.68069
DOI: 10.1016/0304-3975(84)90131-2
author: Tom Head
published in: Theoretical Computer Science
publication date: 1984-01-01T00:00:00Z
review text: An algorithm is given for constructing satisfactory representations of each of the sequences belonging to the adherence of an arbitrary DOL- language. This is done by the use of auxiliary DOL-systems. The solution of the adherence equivalence problem is completed for DOL-languages by employing the solution of the limit equivalence problem to auxiliary DOL- system.
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 3943054
zbMATH Keywords: auxiliary DOL-systems
zbMATH Keywords: adherence equivalence problem
zbMATH Keywords: limit equivalence problem
MaRDI profile type: Publication
full work available at URL: 0304-3975(84)90131-2
OpenAlex ID: W2059389477
cites work: Adherences of languages
cites work: On infinite words obtained by iterating morphisms
cites work: Doubly deterministic tabled OL systems
cites work: Q4198075
cites work: Hypercodes in deterministic and slender 0L languages
cites work: Q4062662
cites work: Q4140407
cites work: Q3948608
Recommended article: Repetition of subwords in DOL languages
Recommended article: Q3332269
Recommended article: Languages of colonies
Recommended article: Henselianity and the Denef-Pas language
Recommended article: Q3327735
Recommended article: Q3687738
Recommended article: Q4407423
Recommended article: Q3730030
Recommended article: Q3984708
description: scientific article; zbMATH DE number 3943054