Characterizations of right dense languages
type: Item
instance of: scholarly article
title: Characterizations of right dense languages
zbMATH Open document ID: 0581.20066
DOI: 10.1007/BF02573179
author: H. J. Shyr
published in: Semigroup Forum
publication date: 1986-01-01T00:00:00Z
full work available at URL: https://eudml.org/doc/134790
review text: Let X be an alphabet containing more than one letter and let \(X^*\) be the free monoid generated by X. A language \(S\subseteq X^*\) is right dense if \(uX^*\cap S\neq \emptyset\) for all \(u\in X^*\). The purpose of this paper is to give characterizations of right dense languages.
Mathematics Subject Classification ID: 20M35
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 20M05
zbMATH DE Number: 3929310
zbMATH Keywords: alphabet
zbMATH Keywords: free monoid
zbMATH Keywords: right dense languages
MaRDI profile type: Publication
cites work: Some properties of disjunctive languages on a free monoid
cites work: Disjunctive languages on a free monoid
cites work: A characterization of dense languages
cites work: Q3711766
Recommended article: Right \(k\)-dense languages
Recommended article: A characterization of dense languages
Recommended article: A characterisation of deterministic context-free languages by means of right-congruences
Recommended article: Characterizations of rational \(\omega\)-languages by means of right congruences
Recommended article: Q3711766
Recommended article: On characterizations of recursively enumerable languages
Recommended article: On languages defined by generalized principal right congruences
Recommended article: Q4016380
Recommended article: Most Complex Regular Right-Ideal Languages
Recommended article: Q4005180
description: scientific article; zbMATH DE number 3929310