On a question concerning certain free submonoids

From MaRDI portal

Revision as of 03:25, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5540495

Jump to:navigation, search

DOI10.1016/S0021-9800(66)80015-7zbMath0158.02302MaRDI QIDQ5540495

No author found.

Publication date: 1966

Published in: Journal of Combinatorial Theory (Search for Journal in Brave)

zbMATH Keywords

generalized groups, semigroups

Related Items (12)

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.

This page was built for publication: On a question concerning certain free submonoids

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5540495&oldid=30130316"