Some results in \(r\)-disjunctive languages and related topics

DOI10.1007/S00500-017-2572-0zbMath1425.68241OpenAlexW2605508580MaRDI QIDQ1701724

Kar Ping Shum, Y. Q. Guo, Dianzhou Zhang

Publication date: 27 February 2018

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-017-2572-0

zbMATH Keywords

decompositionsyntactic congruencessyntactic monoids\(r\)-disjunctive languages\(r\)-regular languagescompletely infix-\(k\)-disjunctive languagesproperly partially infix-\(k\)-disjunctive languagestrivially infix-\(k\)-disjunctive languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Some results on \((k, m)\)-comma codes ⋮ Some combinatorial properties of solid codes ⋮ The applications of solid codes to r-R and r-D languages

Cites Work

• On some decompositions of r-disjunctive languages
• Solid codes and disjunctive domains
• Relatively f-disjunctive languages
• Disjunctive decomposition of languages
• Relatively regular languages and thin codes
• 𝒫𝒮-regular languages
• F-Disjunctive languagest
• Ordered catenation and regular free disjunctive languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some results in \(r\)-disjunctive languages and related topics