The decidability of the dol prefix problem

DOI10.1080/00207167708803132zbMATH Open0358.68114OpenAlexW2033904825MaRDI QIDQ4131049FDOQ4131049

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

• Development systems with locally catenative formulas
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (13)

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

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)