Adherences of DOL languages

DOI10.1016/0304-3975(84)90131-2MaRDI QIDQ1072713zbMATH OpenOpenAlexFDO

Authors Tom Head

Publication date 1984

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(84)90131-2

zbMATH Keywords

adherence equivalence problem auxiliary DOL-systems limit equivalence problem

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

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.

Recommendations

Cites work

Cited in

(5)

This page was built for publication: Adherences of DOL languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1072713)