n-Prefix–suffix languages∗

DOI10.1080/00207168908803768zbMath0681.68097OpenAlexW2000929884MaRDI QIDQ4730802

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

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

prefix coderational languagessuffix codecombinatories of words

Mathematics Subject Classification ID

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

Related Items

INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES, Transducers and the decidability of independence in free monoids, OVERLAP-FREE LANGUAGES AND SOLID CODES, Relations on free monoids, their independent sets, and codes¹, Codes defined by multiple sets of trajectories, Structure of 3-infix-outfix maximal codes., \(n\)-PS-codes, 2-infix-outfix codes and some related classes of codes, Languages whose \(n\)-element subsets are codes, Outfix and infix codes and related classes of languages, \(k\)-p-infix codes and semaphore codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item