Relatively f-disjunctive languages

DOI10.1007/BF02573141zbMath0648.20064MaRDI QIDQ1105049

Y. Q. Guo, Cecília M. Reis, Gabriel Thierrin

Publication date: 1988

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

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

zbMATH Keywords

finite alphabetfree monoidsyntactic congruencedense languagebidense non-regular languagesf-disjunctive languagefd-domain

Mathematics Subject Classification ID

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

Related Items (5)

Some results in \(r\)-disjunctive languages and related topics ⋮ P-disjunctive ω-languages ⋮ Solid codes and the uniform density of fd-domains. ⋮ Relatively regular languages and thin codes ⋮ The applications of solid codes to r-R and r-D languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Disjunctive decomposition of languages
• F-Disjunctive languagest
• Infix Congruences on a Free Monoid
• Disjunctive languages on a free monoid
• Some properties of disjunctive languages on a free monoid

This page was built for publication: Relatively f-disjunctive languages