Back to Search
Start Over
Disjunctive decomposition of languages
- Source :
- Theoretical Computer Science. 46:47-51
- Publication Year :
- 1986
- Publisher :
- Elsevier BV, 1986.
-
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.
- Subjects :
- Discrete mathematics
Disjoint union
General Computer Science
010102 general mathematics
InformationSystems_DATABASEMANAGEMENT
02 engineering and technology
01 natural sciences
Theoretical Computer Science
Philosophy of language
TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES
Intersection
TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS
Free monoid
Formal language
0202 electrical engineering, electronic engineering, information engineering
Decomposition (computer science)
020201 artificial intelligence & image processing
Decomposition method (constraint satisfaction)
0101 mathematics
Computer Science(all)
Mathematics
Subjects
Details
- ISSN :
- 03043975
- Volume :
- 46
- Database :
- OpenAIRE
- Journal :
- Theoretical Computer Science
- Accession number :
- edsair.doi.dedup.....c5a87808018d0a0798f30c6e3dda03dc