On the equivalence problem for binary DOL systems

DOI10.1016/S0019-9958(81)90367-3zbMath0497.68048MaRDI QIDQ3962486

Juhani Karhumäki

Publication date: 1981

Published in: Information and Control (Search for Journal in Brave)

zbMATH Keywords

DOL equivalence problemcharacterization of equality languages

Mathematics Subject Classification ID

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

Related Items (12)

A simple undecidable problem: the inclusion problem for finite substitutions on \(ab^* c\) ⋮ Equality sets of binary D0L sequences ⋮ A new bound for the D0L sequence equivalence problem ⋮ Bounds for the D0L language equivalence problem ⋮ D0L sequence equivalence is inPfor fixed alphabets ⋮ Marked D0L systems and the \(2n\)-conjecture ⋮ Fibonacci morphisms and Sturmian words ⋮ Explicit test sets for iterated morphisms in free monoids and metabelian groups ⋮ Easy cases of the D0L sequence equivalence problem ⋮ EQUALITY SETS OF MORPHIC WORD SEQUENCES ⋮ An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet ⋮ The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids

This page was built for publication: On the equivalence problem for binary DOL systems