F-Disjunctive languagest

DOI10.1080/00207168608803491zbMath0655.68100OpenAlexW2051375388WikidataQ126245653 ScholiaQ126245653MaRDI QIDQ3802658

Gabriel Thierrin, H. J. Shyr, Y. Q. Guo

Publication date: 1986

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168608803491

zbMATH Keywords

disjunctive languagessyntactic monoidsyntactic congruence

Mathematics Subject Classification ID

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

Related Items (9)

Relatively f-disjunctive languages ⋮ 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 ⋮ Semigroups withI-Quasi Length and Syntactic Semigroups ⋮ A note on F-disjunctive languages ⋮ The applications of solid codes to r-R and r-D languages ⋮ Infix Congruences on a Free Monoid

Cites Work

• 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: F-Disjunctive languagest