Disjunctive languages on a free monoid

DOI10.1016/S0019-9958(77)80008-9MaRDI QIDQ4125812zbMATH OpenOpenAlexFDO

Authors H. J. Shyr

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(19)

• F-Disjunctive languagest
• Relatively regular languages and thin codes
• Onn-power prefix languages
• A note on autodense related languages
• Prefix Primitive Languages
• The disjunctivity of primitive languages
• Some property-preserving homomorphisms
• Regular autodense languages
• Classifications of dense languages
• Semigroups with \(I\)-quasi length and syntactic semigroups.
• Some properties of the disjunctive languages contained in Q
• Quasi-completely right disjunctive languages
• Solid codes and disjunctive domains
• Characterizations of right dense languages
• \(P\)-disjunctive \(\omega \)-languages
• Relatively f-disjunctive languages
• A characterization of dense languages
• Local languages
• Disjunctive decomposition of languages

This page was built for publication: Disjunctive languages on a free monoid

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4125812)