On a Conjecture of Schnoebelen
- 306 Downloads
The notion of sequential and parallel decomposition of a language over a set of languages was introduced by Schnoebelen. A language is decomposable if it belongs to a finite set of languages S such that each member of S admits a sequential and parallel decomposition over S. We disprove a conjecture of Schnoebelen concerning decomposable languages and establish some new properties of these languages.
KeywordsParallel System Group Language Sequential System Closure Property Rational Language
Unable to display preview. Download preview PDF.
- 1.J.C.M. Baeten and W.P. Weijland. Process algebra, volume 18 of Cambridge Tract in. Theoretical Computer Science. Cambridge University Press, Cambridge UK, 1990.Google Scholar
- 7.Ph. Schnoebelen. Decomposable regular languages and the shuffle operator. EATCS. Bull., (67):283–289, 1999.Google Scholar