Hypercodes
From MaRDI portal
Publication:5183391
DOI10.1016/S0019-9958(74)80022-7zbMath0274.94020MaRDI QIDQ5183391
Publication date: 1974
Published in: Information and Control (Search for Journal in Brave)
Related Items (13)
Relations on free monoids, their independent sets, and codes1 ⋮ Shuffle Relations and Codes ⋮ Decidability of involution hypercodes ⋮ Hypercodes, Right Convex Languages and their Syntactic Monoids ⋮ DOL schemes and the periodicity of string embeddings ⋮ Out Subword-Free Languages and Its Subclasses ⋮ Decision problems for convex languages ⋮ E-convex infix codes ⋮ Fixed languages and the adult languages of ol schemest† ⋮ Infix Congruences on a Free Monoid ⋮ Maximal chains of subwords and up-down sequences of permutations ⋮ Towards a General Concept of Hypercodes ⋮ Expanded subalphabets in the theories of languages and semigroups†
This page was built for publication: Hypercodes