scientific article; zbMATH DE number 4039328

MaRDI QIDQ3777482zbMATH OpenFDO

Authors Helmut Jürgensen, Gabriel Thierrin

Publication date 1986

zbMATH Keywords

syntactic monoidinfix codereflective codesThue code

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• The Syntactic Monoid of an Infix Code
• Infix Congruences on a Free Monoid
• scientific article; zbMATH DE number 4189637
• E-convex infix codes
• Finite maximal infix codes

Cited in

(12)

• n-Prefix–suffix languages^∗
• The syntactic monoid of hairpin-free languages
• Finite maximal infix codes
• Anti-commutative languages and n-codes
• The Syntactic Monoid of an Infix Code
• Outfix and infix codes and related classes of languages
• Every regular bifix code is a finite union of regular infix codes
• Languages whose \(n\)-element subsets are codes
• Infix Congruences on a Free Monoid
• E-convex infix codes
• Code Offset in the Exponent.
• Some properties of extractable codes and insertable codes

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