Some properties of disjunctive languages on a free monoid
From MaRDI portal
Publication:4153613
DOI10.1016/S0019-9958(78)90578-8zbMath0376.68044OpenAlexW2002895162MaRDI QIDQ4153613
Publication date: 1978
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(78)90578-8
Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (31)
Asymptotic approximation by regular languages ⋮ Disjunctive splittability of languages ⋮ Relatively f-disjunctive languages ⋮ On primitive words with non-primitive product ⋮ A note of ins-primitive words ⋮ Onn-power prefix languages ⋮ Quasi-completely right disjunctive languages ⋮ Disjoint long cycles in a graph ⋮ Duplication in DNA Sequences ⋮ Some kinds of primitive and non-primitive words ⋮ F-Disjunctive languagest ⋮ P-disjunctive ω-languages ⋮ Languages and P0L schemes ⋮ Solid codes and the uniform density of fd-domains. ⋮ Relatively regular languages and thin codes ⋮ The dual equivalence of equations and coequations for automata ⋮ Semigroups withI-Quasi Length and Syntactic Semigroups ⋮ The disjunctivity of primitive languages ⋮ Disjunctive languages and compatible orders ⋮ A note on autodense related languages ⋮ Prefix-primitive annihilators of languages under some operations ⋮ A note on F-disjunctive languages ⋮ Classifications of dense languages ⋮ Overlapping words, codes, disjunctivity and density of languages ⋮ Some properties of involution palindrome languages ⋮ The disjunctivities of \(\omega\)-languages. ⋮ Word-paired insertions of languages ⋮ Some properties of the disjunctive languages contained in \(Q\) ⋮ \(d\)-minimal languages ⋮ A characterization of dense languages ⋮ Characterizations of right dense languages
This page was built for publication: Some properties of disjunctive languages on a free monoid
