A note on F-disjunctive languages

DOI10.1007/BF02575012MaRDI QIDQ581552zbMATH OpenFDO

Authors Cecília M. Reis

Publication date 1987

Published in Semigroup Forum (Search for Journal in Brave)

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

zbMATH Keywords

pf-disjunctive congruencespf-disjunctive languages

Mathematics Subject Classification ID

Semigroups in automata theory, linguistics, etc. (20M35) Formal languages and automata (68Q45)

Review text

The properties of the pf-disjunctive languages (i.e. f-disjunctive languages which are not disjunctive) in relationship with pf-disjunctive congruences are studied. Some improved proofs or more general results for f-disjunctive languages are presented.

Recommendations

• F-Disjunctive languagest
• Relatively f-disjunctive languages
• Disjunctive languages and compatible orders
• On some decompositions of r-disjunctive languages
• scientific article; zbMATH DE number 3978416

Cites work

• F-Disjunctive languagest
• scientific article; zbMATH DE number 3654376 (Why is no real title available?)
• Some properties of disjunctive languages on a free monoid

Cited in

(11)

• Relatively f-disjunctive languages
• Some results in r-disjunctive languages and related topics
• Solid codes and the uniform density of fd-domains.
• Semigroups with I-quasi length and syntactic semigroups.
• F-Disjunctive languagest
• Infix Congruences on a Free Monoid
• A note on the paper “disjunctive languages and compatible orders”
• On f-Disjunctive Languages, f-Disjunctive Domains and Solid Codes
• The concatenation of thin languages and r-disjunctive languages -- several studies on combinatorial semigroups. I
• Some properties of the disjunctive languages contained in Q
• The applications of solid codes to r-R and r-D languages

This page was built for publication: A note on F-disjunctive languages

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