The decidability of the dol prefix problem

DOI10.1080/00207167708803132MaRDI QIDQ4131049zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3644504 (Why is no real title available?)
• scientific article; zbMATH DE number 3480114 (Why is no real title available?)
• Development systems with locally catenative formulas

Cited in

(13)

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

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

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