n-PS-codes, 2-infix-outfix codes and some related classes of codes
From MaRDI portal
Publication:6150116
DOI10.1007/S00236-023-00449-1MaRDI QIDQ6150116FDOQ6150116
Authors: Haiyan Liu, Rongdong Cui, Tianjie Zhang 
Publication date: 5 March 2024
Published in: Acta Informatica (Search for Journal in Brave)
Algebraic theory of languages and automata (68Q70) Combinatorics on words (68R15) Theory of computing (68Qxx) Semigroups in automata theory, linguistics, etc. (20M35)
Cites Work
- Title not available (Why is that?)
- Codes and automata.
- Relations on free monoids, their independent sets, and codes1
- Anti-commutative languages and n-codes
- Structure of 3-infix-outfix maximal codes.
- n-Prefix–suffix languages∗
- \(k\)-p-infix codes and semaphore codes
- Some combinatorial properties of solid codes
- On \(k\)-comma codes
- Some results on \((k, m)\)-comma codes
- Characterizations of \(k\)-comma codes and \(k\)-comma intercodes
This page was built for publication: \(n\)-PS-codes, 2-infix-outfix codes and some related classes of codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6150116)
