Name
Abstract | ||
|---|---|---|
Some relations between dense languages and their semidiscrete disjunctive sublanguages are considered. Several decompositions of dense languages into disjunctive components are established. As an application, it is shown that every language is either the disjoint union or the intersection of two disjunctive languages. |
Year | DOI | Venue |
|---|---|---|
1986 | 10.1016/0304-3975(86)90020-4 | Theor. Comput. Sci. |
Keywords | DocType | Volume |
disjunctive decomposition | Journal | 46 |
Issue | ISSN | Citations |
1 | Theoretical Computer Science | 1 |
PageRank | References | Authors |
0.43 | 2 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Y Q Guo | 1 | 4 | 1.83 |
| G W Xu | 2 | 1 | 0.43 |
| G. Thierrin | 3 | 68 | 10.18 |