Quasi-completely right disjunctive languages

DOI10.1007/BF02573376zbMath0695.20039OpenAlexW1979170579MaRDI QIDQ909802

N. E. Zubov

Publication date: 1990

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/135034

zbMATH Keywords

languageprefix codefree monoidalphabetquasi-completely right disjunctive sublanguageright dense language

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Cites Work

• Characterizations of right dense languages
• Ordered catenation and regular free disjunctive languages
• Disjunctive languages on a free monoid
• Some properties of disjunctive languages on a free monoid
• H-bounded and semi-discrete languages

This page was built for publication: Quasi-completely right disjunctive languages