scientific article; zbMATH DE number 177835

MaRDI QIDQ4038713zbMATH OpenFDO

Authors Christian Choffrut

Publication date 18 May 1993

zbMATH Keywords

DOL-sequenceDOL-systemsequations in wordsfinite deciphering delay of codeslinear recurrence equationslocally catenative systemssubstitutions in the free monoids

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 176925
• scientific article; zbMATH DE number 2086673
• The local catenativity of DOL-sequences in free commutative monoids is decidable in the binary case
• Periodic D0L languages
• scientific article; zbMATH DE number 3880123

Cited in

(5)

• scientific article; zbMATH DE number 3880123 (Why is no real title available?)
• The local catenativity of DOL-sequences in free commutative monoids is decidable in the binary case
• scientific article; zbMATH DE number 176925 (Why is no real title available?)
• If a DOL language is k-power free then it is circular
• On standard locally catenative L schemes

This page was built for publication:

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