Some results in \(r\)-disjunctive languages and related topics
From MaRDI portal
Publication:1701724
DOI10.1007/s00500-017-2572-0zbMath1425.68241MaRDI 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
decomposition; syntactic congruences; syntactic monoids; \(r\)-disjunctive languages; \(r\)-regular languages; completely infix-\(k\)-disjunctive languages; properly partially infix-\(k\)-disjunctive languages; trivially infix-\(k\)-disjunctive languages
68Q45: Formal languages and automata
Related Items
The applications of solid codes to r-R and r-D languages, Some combinatorial properties of solid codes, Some results on \((k, m)\)-comma codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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