Disjunctive decomposition of languages

DOI10.1016/0304-3975(86)90020-4zbMath0618.68064OpenAlexW1965752588MaRDI QIDQ1822508

Y. Q. Guo, Guangwu Xu, Gabriel Thierrin

Publication date: 1986

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90020-4

zbMATH Keywords

disjunctive languagesdense languagessemidiscrete disjunctive sublanguages

Mathematics Subject Classification ID

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

Related Items (5)

Relatively f-disjunctive languages ⋮ Some results in \(r\)-disjunctive languages and related topics ⋮ P-disjunctive ω-languages ⋮ Semigroups withI-Quasi Length and Syntactic Semigroups ⋮ On the homological classification of semigroups with local units

Cites Work

• A characterization of dense languages
• Disjunctive languages on a free monoid
• H-bounded and semi-discrete languages
• Unnamed Item
• Unnamed Item

This page was built for publication: Disjunctive decomposition of languages