E-convex infix codes

DOI10.1007/BF00403410zbMath0614.20045OpenAlexW2011823835MaRDI QIDQ1820251

Y. Q. Guo, H. J. Shyr, Gabriel Thierrin

Publication date: 1986

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00403410

zbMATH Keywords

partial orderslanguagesinfix orderbifix codesinfix codese-convex infix codesembedding orderhypercodesincomparable words

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Other types of codes (94B60) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (1)

Outfix and infix codes and related classes of languages

Cites Work

• Towards a General Concept of Hypercodes
• Hypercodes
• On free monoids partially ordered by embedding
• Ordering by Divisibility in Abstract Algebras
• Unnamed Item

This page was built for publication: E-convex infix codes