Some properties of extractable codes and insertable codes

DOI10.1142/S0129054116400128MaRDI QIDQ5740528zbMATH OpenOpenAlexFDO

Authors Y. Kunimochi

Publication date 27 July 2016

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054116400128

zbMATH Keywords

codesstrong codessyntactic monoids

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• E-convex infix codes
• scientific article; zbMATH DE number 4039328
• On the Reversibility of Parallel Insertion, and Its Relation to Comma Codes
• On codes defined by binary relations. I: Embedding problem
• scientific article; zbMATH DE number 4189637

Cites work

• Insertion and deletion closure of languages
• On supersymmetric fermion lattice systems
• Rational strong codes and structure of rational group languages

This page was built for publication: Some properties of extractable codes and insertable codes

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