The decidability of the dol prefix problem

DOI10.1080/00207167708803132zbMath0358.68114OpenAlexW2033904825MaRDI QIDQ4131049

Matti Linna

Publication date: 1977

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207167708803132

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (13)

On the defect theorem and simplifiability ⋮ A defect property of codes with unbounded delays ⋮ On the periodicity of morphisms on free monoids ⋮ Sur le théorème du defaut ⋮ Recognizability of morphisms ⋮ Compatibility relations on codes and free monoids ⋮ On infinite words obtained by iterating morphisms ⋮ Dynamical properties of PWD0L systems ⋮ Defect theorems with compatibility relations. ⋮ On the simplification of infinite morphic words ⋮ Systems of equations over a free monoid and Ehrenfeucht's conjecture ⋮ Code properties and homomorphisms of DOL systems ⋮ Cumulative defect.

Cites Work

• Development systems with locally catenative formulas
• Unnamed Item
• Unnamed Item

This page was built for publication: The decidability of the dol prefix problem