On a question concerning certain free submonoids
From MaRDI portal
Publication:5540495
DOI10.1016/S0021-9800(66)80015-7zbMath0158.02302MaRDI QIDQ5540495
Publication date: 1966
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Related Items
An answer to a question about finite maximal prefix sets of words, About prefix sets of words, On infinitary finite length codes, Completion of codes with finite bi-decoding delays., Maximal codes with bounded deciphering delay, Codes induced by alternative codes, Embedding a \(\theta \)-invariant code into a complete one, Synchronization and simplification, On completion of codes with finite deciphering delay, Maximal prefix products, HOMOMORPHISMS PRESERVING DETERMINISTIC CONTEXT-FREE LANGUAGES, On maximal codes with a finite interpreting delay.
