Disjunctive languages on a free monoid
From MaRDI portal
Publication:4125812
DOI10.1016/S0019-9958(77)80008-9zbMath0354.68108OpenAlexW2070821926MaRDI QIDQ4125812
Publication date: 1977
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(77)80008-9
Related Items (19)
Relatively f-disjunctive languages ⋮ Onn-power prefix languages ⋮ Solid codes and disjunctive domains ⋮ Quasi-completely right disjunctive languages ⋮ F-Disjunctive languagest ⋮ P-disjunctive ω-languages ⋮ Relatively regular languages and thin codes ⋮ Semigroups withI-Quasi Length and Syntactic Semigroups ⋮ The disjunctivity of primitive languages ⋮ Some property-preserving homomorphisms ⋮ Local languages ⋮ A note on autodense related languages ⋮ Prefix Primitive Languages ⋮ Classifications of dense languages ⋮ Regular autodense languages ⋮ Disjunctive decomposition of languages ⋮ Some properties of the disjunctive languages contained in \(Q\) ⋮ A characterization of dense languages ⋮ Characterizations of right dense languages
This page was built for publication: Disjunctive languages on a free monoid
