n-Prefix–suffix languages∗

DOI10.1080/00207168908803768zbMATH Open0681.68097OpenAlexW2000929884MaRDI QIDQ4730802FDOQ4730802

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

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
• Publication:4332299

zbMATH Keywords

prefix coderational languagessuffix codecombinatories of words

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (16)

• INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES
• Overlap-free languages and solid codes
• Codes defined by multiple sets of trajectories
• \(n\)-PS-codes, 2-infix-outfix codes and some related classes of codes
• Two classes of languages related to the prefix codes
• Post-plus languages
• \(k\)-p-infix codes and semaphore codes
• Transducers and the decidability of independence in free monoids
• Anti-commutative languages and n-codes
• Structure of 3-infix-outfix maximal codes.
• Outfix and infix codes and related classes of languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• Languages whose \(n\)-element subsets are codes
• PREFIX-FREE ŁUKASIEWICZ LANGUAGES
• Relations on free monoids, their independent sets, and codes¹

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)