n-Prefix–suffix languages∗

DOI10.1080/00207168908803768MaRDI QIDQ4730802zbMATH OpenOpenAlexFDO

Authors Masami Ito, Helmut Jürgensen, H. J. Shyr, Gabriel Thierrin

Publication date 1989

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207168908803768

zbMATH Keywords

combinatories of wordsprefix coderational languagessuffix code

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Artificial intelligence (68T99)

Recommendations

• Two classes of languages related to the prefix codes
• Anti-commutative languages and n-codes
• scientific article; zbMATH DE number 1552699
• A three-word code which is not prefix-suffix composed
• scientific article; zbMATH DE number 978111

Cited in

(17)

• Languages whose \(n\)-element subsets are codes
• Outfix and infix codes and related classes of languages
• Transducers and the decidability of independence in free monoids
• Structure of 3-infix-outfix maximal codes.
• Anti-commutative languages and n-codes
• Overlap-free languages and solid codes
• PREFIX-FREE ŁUKASIEWICZ LANGUAGES
• scientific article; zbMATH DE number 4147541 (Why is no real title available?)
• Relations on free monoids, their independent sets, and codes¹
• Two classes of languages related to the prefix codes
• scientific article; zbMATH DE number 1552699 (Why is no real title available?)
• INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES
• k-p-infix codes and semaphore codes
• Post-plus languages
• \(n\)-PS-codes, 2-infix-outfix codes and some related classes of codes
• A three-word code which is not prefix-suffix composed
• Codes defined by multiple sets of trajectories

This page was built for publication: n-Prefix–suffix languages^∗

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